* installing *source* package 'SurfaceMesh' ...
** this is package 'SurfaceMesh' version '0.1.2'
** package 'SurfaceMesh' successfully unpacked and MD5 sums checked
** using staged installation

   **********************************************
   WARNING: this package has a configure script
         It probably needs manual configuration
   **********************************************


** libs
specified C++17
using C++ compiler: 'g++.exe (GCC) 14.3.0'
using C++17
make[1]: Entering directory '/d/temp/2026_11_18_19_01_12_26750/RtmpEh6Oah/R.INSTALL18581824e07561/SurfaceMesh/src'
g++  -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.7/BH/include' -I'D:/RCompile/CRANpkg/lib/4.7/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"   -DCGAL_HEADER_ONLY=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c RcppExports.cpp -o RcppExports.o
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:205,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Dense:1,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/RcppEigenForward.h:28,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/RcppEigen.h:25,
                 from RcppExports.cpp:4:
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                       ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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) {
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:174:
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:165:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<float, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<float> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46:   required from here
   24 |     ResAlignment = traits<Quaternion<float> >::Alignment
      |                                              ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:271:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<float, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<float, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<float> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<float>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3:   required from here
   27 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<double> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47:   required from here
   98 |     ResAlignment = traits<Quaternion<double> >::Alignment
      |                                               ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<double> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<double>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3:   required from here
  102 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/SparseCore:37,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Sparse:26,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/RcppEigenForward.h:29:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::SparseMatrix<double, 0, int> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7:   required from 'class Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 0, int> >'
   36 | class SparseCompressedBase
      |       ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7:   required from 'class Eigen::SparseMatrix<double, 0, int>'
   96 | class SparseMatrix
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25:   required from here
   61 |   typedef Triplet<double> T;
      |                         ^
D:/RCompile/CRANpkg/lib/4.7/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++  -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.7/BH/include' -I'D:/RCompile/CRANpkg/lib/4.7/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"   -DCGAL_HEADER_ONLY=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c export_alpha_wrap.cpp -o export_alpha_wrap.o
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:205,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dimension.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Bbox_2.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic_classes.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
                 from SurfaceMesh.h:17,
                 from export_alpha_wrap.cpp:14:
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                       ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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) {
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:174:
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/bind.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian_converter.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Filtered_kernel.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:21:
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/property_map.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
                 from SurfaceMesh.h:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/std_thread.h:43,
                 from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/thread:45,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/config.h:428,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20:
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/assert.hpp:35,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:127:16:   required from 'struct boost::range_detail::IncrementableIteratorConcept<long long unsigned int*>'
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:31,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:20:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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> >]':
D:/RCompile/CRANpkg/lib/4.7/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>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/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)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/iterator/iterator_concepts.hpp:106:7:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/iterator/iterator_concepts.hpp:106:7:   required from 'struct boost::range_detail::IncrementableIteratorConcept<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13:   required from 'struct boost::range_detail::IncrementableIteratorConcept<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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> >]':
D:/RCompile/CRANpkg/lib/4.7/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>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/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)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:154:13:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:154:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:280:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:280:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:280:9:   required from 'struct boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:127:16:   required from 'struct boost::range_detail::IncrementableIteratorConcept<const long long unsigned int*>'
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13:   required from 'struct boost::range_detail::IncrementableIteratorConcept<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:283:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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<const long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:283:9:   required from 'struct boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 = const long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:286:9:   required from 'struct boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:878:44:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_manifold_surface(OutputMesh&, OVPM) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  878 |     if(!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = std::array<long long unsigned int, 3>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:286:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  286 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:127:16:   required from 'struct boost::range_detail::IncrementableIteratorConcept<long long unsigned int*>'
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible<TT>::~CopyConstructible() [with TT = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13:   required from 'struct boost::range_detail::IncrementableIteratorConcept<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  138 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<const long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<const long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:127:16:   required from 'struct boost::range_detail::IncrementableIteratorConcept<const long long unsigned int*>'
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible<TT>::~CopyConstructible() [with TT = const long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<const long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<const long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13:   required from 'struct boost::range_detail::IncrementableIteratorConcept<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 = const long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  138 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<const long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<const long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = const long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<const long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 = const long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:286:9:   required from 'struct boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  905 |       extract_manifold_surface(output_mesh, ovpm);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20:   required from 'void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]'
  388 |     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
      |     ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21:   required from 'void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]'
  360 |   alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]'
  372 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22:   required from 'void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]'
  381 |   return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21:   required from here
   37 |   CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
      |   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = std::array<long long unsigned int, 3>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:286:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  286 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Quotient.h:37,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Kernel_d/Cartesian_const_iterator_d.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Homogeneous/VectorH2.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Homogeneous/predicates_on_directionsH2.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Homogeneous/DirectionH2.h:99,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Homogeneous/Homogeneous_base.h:29,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Simple_homogeneous.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_kernel_selector.h:24,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Filtered_kernel.h:22:
In member function 'boost::multiprecision::backends::cpp_int_base<MinBits, MaxBits, boost::multiprecision::signed_magnitude, Checked, Allocator, false>::limb_pointer boost::multiprecision::backends::cpp_int_base<MinBits, MaxBits, boost::multiprecision::signed_magnitude, Checked, Allocator, false>::limbs() [with long long unsigned int MinBits = 512; long long unsigned int MaxBits = 18446744073709551615; boost::multiprecision::cpp_int_check_type Checked = boost::multiprecision::unchecked; Allocator = std::allocator<long long unsigned int>]',
    inlined from 'boost::multiprecision::backends::cpp_int_base<MinBits, MaxBits, boost::multiprecision::signed_magnitude, Checked, Allocator, false>::~cpp_int_base() [with long long unsigned int MinBits = 512; long long unsigned int MaxBits = 18446744073709551615; boost::multiprecision::cpp_int_check_type Checked = boost::multiprecision::unchecked; Allocator = std::allocator<long long unsigned int>]' at D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multiprecision/cpp_int.hpp:477:32,
    inlined from 'boost::multiprecision::backends::cpp_int_backend<512>::~cpp_int_backend()' at D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multiprecision/cpp_int.hpp:1330:8,
    inlined from 'boost::multiprecision::backends::cpp_int_backend<512>::~cpp_int_backend()' at D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multiprecision/cpp_int.hpp:1330:8,
    inlined from 'boost::multiprecision::number<boost::multiprecision::backends::cpp_int_backend<512> >::~number()' at D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multiprecision/number.hpp:43:7,
    inlined from 'CGAL::cpp_float::~cpp_float()' at D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/cpp_float.h:67:7,
    inlined from 'CGAL::Vector_3<R_>::Vector_3(T1&&, T2&&, T3&&) [with T1 = double; T2 = double; T3 = double; R_ = CGAL::Simple_cartesian<CGAL::cpp_float>]' at D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Vector_3.h:93:43:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multiprecision/cpp_int.hpp:352:84: warning: '<unnamed>.CGAL::cpp_float::man.boost::multiprecision::number<boost::multiprecision::backends::cpp_int_backend<512, 0, boost::multiprecision::signed_magnitude, boost::multiprecision::unchecked, std::allocator<long long unsigned int> >, boost::multiprecision::et_on>::m_backend.boost::multiprecision::backends::cpp_int_backend<512, 0, boost::multiprecision::signed_magnitude, boost::multiprecision::unchecked, std::allocator<long long unsigned int> >::<unnamed>.boost::multiprecision::backends::cpp_int_base<512, 18446744073709551615, boost::multiprecision::signed_magnitude, boost::multiprecision::unchecked, std::allocator<long long unsigned int>, false>::m_data.boost::multiprecision::backends::cpp_int_base<512, 18446744073709551615, boost::multiprecision::signed_magnitude, boost::multiprecision::unchecked, std::allocator<long long unsigned int>, false>::data_type::ld.boost::multiprecision::backends::cpp_int_base<512, 18446744073709551615, boost::multiprecision::signed_magnitude, boost::multiprecision::unchecked, std::allocator<long long unsigned int>, false>::limb_data::data' may be used uninitialized [-Wmaybe-uninitialized]
  352 |    BOOST_MP_FORCEINLINE limb_pointer          limbs() noexcept { return m_internal ? m_data.la : m_data.ld.data; }
      |                                                                         ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/user_classes.h:37,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Kernel/global_functions_2.h:25,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Kernel/global_functions.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:22:
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Vector_3.h: In function 'CGAL::Vector_3<R_>::Vector_3(T1&&, T2&&, T3&&) [with T1 = double; T2 = double; T3 = double; R_ = CGAL::Simple_cartesian<CGAL::cpp_float>]':
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Vector_3.h:93:43: note: '<anonymous>' declared here
   93 |     : Rep(typename R::Construct_vector_3()(Return_base_tag(), std::forward<T1>(x),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |                                                               std::forward<T2>(y),
      |                                                               ~~~~~~~~~~~~~~~~~~~~
   95 |                                                               std::forward<T3>(z)))
      |                                                               ~~~~~~~~~~~~~~~~~~~~
In member function 'boost::multiprecision::backends::cpp_int_base<MinBits, MaxBits, boost::multiprecision::signed_magnitude, Checked, Allocator, false>::limb_pointer boost::multiprecision::backends::cpp_int_base<MinBits, MaxBits, boost::multiprecision::signed_magnitude, Checked, Allocator, false>::limbs() [with long long unsigned int MinBits = 512; long long unsigned int MaxBits = 18446744073709551615; boost::multiprecision::cpp_int_check_type Checked = boost::multiprecision::unchecked; Allocator = std::allocator<long long unsigned int>]',
    inlined from 'boost::multiprecision::backends::cpp_int_base<MinBits, MaxBits, boost::multiprecision::signed_magnitude, Checked, Allocator, false>::~cpp_int_base() [with long long unsigned int MinBits = 512; long long unsigned int MaxBits = 18446744073709551615; boost::multiprecision::cpp_int_check_type Checked = boost::multiprecision::unchecked; Allocator = std::allocator<long long unsigned int>]' at D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multiprecision/cpp_int.hpp:477:32,
    inlined from 'boost::multiprecision::backends::cpp_int_backend<512>::~cpp_int_backend()' at D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multiprecision/cpp_int.hpp:1330:8,
    inlined from 'boost::multiprecision::backends::cpp_int_backend<512>::~cpp_int_backend()' at D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multiprecision/cpp_int.hpp:1330:8,
    inlined from 'boost::multiprecision::number<boost::multiprecision::backends::cpp_int_backend<512> >::~number()' at D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multiprecision/number.hpp:43:7,
    inlined from 'CGAL::cpp_float::~cpp_float()' at D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/cpp_float.h:67:7,
    inlined from 'CGAL::Vector_3<R_>::Vector_3(T1&&, T2&&, T3&&) [with T1 = double; T2 = double; T3 = double; R_ = CGAL::Simple_cartesian<CGAL::cpp_float>]' at D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Vector_3.h:93:43:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multiprecision/cpp_int.hpp:352:84: warning: '<unnamed>.CGAL::cpp_float::man.boost::multiprecision::number<boost::multiprecision::backends::cpp_int_backend<512, 0, boost::multiprecision::signed_magnitude, boost::multiprecision::unchecked, std::allocator<long long unsigned int> >, boost::multiprecision::et_on>::m_backend.boost::multiprecision::backends::cpp_int_backend<512, 0, boost::multiprecision::signed_magnitude, boost::multiprecision::unchecked, std::allocator<long long unsigned int> >::<unnamed>.boost::multiprecision::backends::cpp_int_base<512, 18446744073709551615, boost::multiprecision::signed_magnitude, boost::multiprecision::unchecked, std::allocator<long long unsigned int>, false>::m_data.boost::multiprecision::backends::cpp_int_base<512, 18446744073709551615, boost::multiprecision::signed_magnitude, boost::multiprecision::unchecked, std::allocator<long long unsigned int>, false>::data_type::ld.boost::multiprecision::backends::cpp_int_base<512, 18446744073709551615, boost::multiprecision::signed_magnitude, boost::multiprecision::unchecked, std::allocator<long long unsigned int>, false>::limb_data::data' may be used uninitialized [-Wmaybe-uninitialized]
  352 |    BOOST_MP_FORCEINLINE limb_pointer          limbs() noexcept { return m_internal ? m_data.la : m_data.ld.data; }
      |                                                                         ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Vector_3.h: In function 'CGAL::Vector_3<R_>::Vector_3(T1&&, T2&&, T3&&) [with T1 = double; T2 = double; T3 = double; R_ = CGAL::Simple_cartesian<CGAL::cpp_float>]':
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Vector_3.h:93:43: note: '<anonymous>' declared here
   93 |     : Rep(typename R::Construct_vector_3()(Return_base_tag(), std::forward<T1>(x),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |                                                               std::forward<T2>(y),
      |                                                               ~~~~~~~~~~~~~~~~~~~~
   95 |                                                               std::forward<T3>(z)))
      |                                                               ~~~~~~~~~~~~~~~~~~~~
In member function 'boost::multiprecision::backends::cpp_int_base<MinBits, MaxBits, boost::multiprecision::signed_magnitude, Checked, Allocator, false>::limb_pointer boost::multiprecision::backends::cpp_int_base<MinBits, MaxBits, boost::multiprecision::signed_magnitude, Checked, Allocator, false>::limbs() [with long long unsigned int MinBits = 512; long long unsigned int MaxBits = 18446744073709551615; boost::multiprecision::cpp_int_check_type Checked = boost::multiprecision::unchecked; Allocator = std::allocator<long long unsigned int>]',
    inlined from 'boost::multiprecision::backends::cpp_int_base<MinBits, MaxBits, boost::multiprecision::signed_magnitude, Checked, Allocator, false>::~cpp_int_base() [with long long unsigned int MinBits = 512; long long unsigned int MaxBits = 18446744073709551615; boost::multiprecision::cpp_int_check_type Checked = boost::multiprecision::unchecked; Allocator = std::allocator<long long unsigned int>]' at D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multiprecision/cpp_int.hpp:477:32,
    inlined from 'boost::multiprecision::backends::cpp_int_backend<512>::~cpp_int_backend()' at D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multiprecision/cpp_int.hpp:1330:8,
    inlined from 'boost::multiprecision::backends::cpp_int_backend<512>::~cpp_int_backend()' at D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multiprecision/cpp_int.hpp:1330:8,
    inlined from 'boost::multiprecision::number<boost::multiprecision::backends::cpp_int_backend<512> >::~number()' at D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multiprecision/number.hpp:43:7,
    inlined from 'CGAL::cpp_float::~cpp_float()' at D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/cpp_float.h:67:7,
    inlined from 'CGAL::Vector_3<R_>::Vector_3(T1&&, T2&&, T3&&) [with T1 = double; T2 = double; T3 = double; R_ = CGAL::Simple_cartesian<CGAL::cpp_float>]' at D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Vector_3.h:93:43:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multiprecision/cpp_int.hpp:352:84: warning: '<unnamed>.CGAL::cpp_float::man.boost::multiprecision::number<boost::multiprecision::backends::cpp_int_backend<512, 0, boost::multiprecision::signed_magnitude, boost::multiprecision::unchecked, std::allocator<long long unsigned int> >, boost::multiprecision::et_on>::m_backend.boost::multiprecision::backends::cpp_int_backend<512, 0, boost::multiprecision::signed_magnitude, boost::multiprecision::unchecked, std::allocator<long long unsigned int> >::<unnamed>.boost::multiprecision::backends::cpp_int_base<512, 18446744073709551615, boost::multiprecision::signed_magnitude, boost::multiprecision::unchecked, std::allocator<long long unsigned int>, false>::m_data.boost::multiprecision::backends::cpp_int_base<512, 18446744073709551615, boost::multiprecision::signed_magnitude, boost::multiprecision::unchecked, std::allocator<long long unsigned int>, false>::data_type::ld.boost::multiprecision::backends::cpp_int_base<512, 18446744073709551615, boost::multiprecision::signed_magnitude, boost::multiprecision::unchecked, std::allocator<long long unsigned int>, false>::limb_data::data' may be used uninitialized [-Wmaybe-uninitialized]
  352 |    BOOST_MP_FORCEINLINE limb_pointer          limbs() noexcept { return m_internal ? m_data.la : m_data.ld.data; }
      |                                                                         ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Vector_3.h: In function 'CGAL::Vector_3<R_>::Vector_3(T1&&, T2&&, T3&&) [with T1 = double; T2 = double; T3 = double; R_ = CGAL::Simple_cartesian<CGAL::cpp_float>]':
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Vector_3.h:93:43: note: '<anonymous>' declared here
   93 |     : Rep(typename R::Construct_vector_3()(Return_base_tag(), std::forward<T1>(x),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |                                                               std::forward<T2>(y),
      |                                                               ~~~~~~~~~~~~~~~~~~~~
   95 |                                                               std::forward<T3>(z)))
      |                                                               ~~~~~~~~~~~~~~~~~~~~
g++  -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.7/BH/include' -I'D:/RCompile/CRANpkg/lib/4.7/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"   -DCGAL_HEADER_ONLY=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c export_boolean.cpp -o export_boolean.o
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:205,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dimension.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Bbox_2.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic_classes.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
                 from SurfaceMesh.h:17,
                 from export_boolean.cpp:14:
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                       ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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) {
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:174:
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/bind.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian_converter.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Filtered_kernel.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:21:
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/property_map.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
                 from SurfaceMesh.h:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/std_thread.h:43,
                 from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/thread:45,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/config.h:428,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20:
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
g++  -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.7/BH/include' -I'D:/RCompile/CRANpkg/lib/4.7/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"   -DCGAL_HEADER_ONLY=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c export_bounding.cpp -o export_bounding.o
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:205,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dimension.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Bbox_2.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic_classes.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
                 from SurfaceMesh.h:17,
                 from export_bounding.cpp:14:
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                       ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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) {
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:174:
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/bind.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian_converter.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Filtered_kernel.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:21:
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/property_map.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
                 from SurfaceMesh.h:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/std_thread.h:43,
                 from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/thread:45,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/config.h:428,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20:
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:165:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<float, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<float> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46:   required from here
   24 |     ResAlignment = traits<Quaternion<float> >::Alignment
      |                                              ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:271:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<float, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<float, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<float> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<float>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3:   required from here
   27 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<double> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47:   required from here
   98 |     ResAlignment = traits<Quaternion<double> >::Alignment
      |                                               ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<double> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<double>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3:   required from here
  102 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 9>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 3, 3> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 3, 3>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_matrix.h:39:8:   required from 'struct CGAL::Eigen_matrix<double, 3, 3>'
   39 | struct Eigen_matrix
      |        ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/Oriented_bounding_box_traits_3.h:59:56:   required from 'class CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>'
   59 |   typedef typename Matrix::EigenType                   EigenType;
      |                                                        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:350:15:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  350 |   Geom_traits traits = choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits));
      |               ^~~~~~
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 3, 3> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 3, 3> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 3, 3>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_matrix.h:39:8:   required from 'struct CGAL::Eigen_matrix<double, 3, 3>'
   39 | struct Eigen_matrix
      |        ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/Oriented_bounding_box_traits_3.h:59:56:   required from 'class CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>'
   59 |   typedef typename Matrix::EigenType                   EigenType;
      |                                                        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:350:15:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  350 |   Geom_traits traits = choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits));
      |               ^~~~~~
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 2>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 2>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 2, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 2, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:146:17:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  146 |     EigenMatrix m = construct_covariance_matrix(cov);
      |                 ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 2>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 2, 1> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 2, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 2, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:149:17:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  149 |     EigenVector eigenvalues_;
      |                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 2, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 2, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:149:17:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  149 |     EigenVector eigenvalues_;
      |                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 3>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 3, 1> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 3, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:149:17:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  149 |     EigenVector eigenvalues_;
      |                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 3, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 3, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:149:17:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  149 |     EigenVector eigenvalues_;
      |                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:176:44:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  176 |       m_best_v->fitness() = compute_fitness(best_m, m_points, m_traits);
      |                             ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, 0>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:92:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 2, 2> >'
   92 |             >::type DiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:97:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 2, 2> >'
   97 |             >::type SubDiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:97:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 2, 2> >'
   97 |             >::type SubDiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, 1, 0, 1, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:92:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 3, 3> >'
   92 |             >::type DiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:97:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 3, 3> >'
   97 |             >::type SubDiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::Matrix<double, 3, 3> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::Matrix<double, 3, 3>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::Matrix<double, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::Matrix<double, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::Matrix<double, 3, 3>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::Matrix<double, 3, 3> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_matrix.h:74:27:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Matrix<double, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Matrix<double, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Matrix<double, 3, 3>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Matrix<double, 3, 3> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_matrix.h:84:43:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, 3>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, 3>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, 3>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 1, 3> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 1, 3> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 1, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 2, 2>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 2, 2> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:453:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 3, 3>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 3, 3> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:453:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_matrix.h:79:43:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:156:20:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  156 |         nelder_mead(m_population[s], nelder_mead_iterations, m_points, m_traits);
      |         ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:777:23:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:777:31:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 2, 1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 2, 1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 2, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<Eigen::Matrix<double, 2, 1> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:815:17:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28:   required from 'struct Eigen::internal::traits<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:398:143:   required from 'Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::TriangularViewType& Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::operator/=(const typename Eigen::internal::traits<T>::Scalar&) [with _MatrixType = Eigen::Matrix<double, 2, 2>; unsigned int _Mode = 1; TriangularViewType = Eigen::TriangularView<Eigen::Matrix<double, 2, 2>, 1>; typename Eigen::internal::traits<T>::Scalar = double]'
  398 |     TriangularViewType&  operator/=(const typename internal::traits<MatrixType>::Scalar& other) { return *this = derived().nestedExpression() / other; }
      |                                                                                                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:455:40:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, -1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>, 1>'
  223 | template<typename Derived> class MapBase<Derived, WriteAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<Eigen::Matrix<double, 2, 1>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 2, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:20:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator*=(const Scalar&) [with Derived = Eigen::Matrix<double, 2, 1>; Scalar = double]'
   20 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:463:14:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:670:23:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:670:31:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:277:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Ref.h:44:50:   required from 'struct Eigen::internal::traits<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >::match<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   44 |       DerivedAlignment = int(evaluator<Derived>::Alignment),
      |                                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Ref.h:288:101:   required by substitution of 'template<class Derived> Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >::Ref(const Eigen::DenseBase<Derived>&, typename Eigen::internal::enable_if<(bool)(Eigen::internal::traits<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >::match<Derived>::MatchAtCompileTime), Derived>::type*) [with Derived = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>]'
  288 |                                  typename internal::enable_if<bool(Traits::template match<Derived>::MatchAtCompileTime),Derived>::type* = 0);
      |                                                                                                     ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:704:25:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  704 |           extract_kernel(tmp, eivecs.col(k), eivecs.col(l));
      |           ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::computeDirect(const MatrixType&, int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; MatrixType = Eigen::Matrix<double, 3, 3>]'
  830 |   internal::direct_selfadjoint_eigenvalues<SelfAdjointEigenSolver,Size,NumTraits<Scalar>::IsComplex>::run(*this,matrix,options);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:101:32:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_matrix(EigenMatrix&, EigenMatrix&, EigenVector&) [with FT = double; unsigned int dim = 3; EigenMatrix = Eigen::Matrix<double, 3, 3>; EigenVector = Eigen::Matrix<double, 3, 1>]'
  101 |       eigensolver.computeDirect(m);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:712:60:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  712 |           eivecs.col(l) -= eivecs.col(k).dot(eivecs.col(l))*eivecs.col(l);
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:731:17:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:398:143:   required from 'Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::TriangularViewType& Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::operator/=(const typename Eigen::internal::traits<T>::Scalar&) [with _MatrixType = Eigen::Matrix<double, 3, 3>; unsigned int _Mode = 1; TriangularViewType = Eigen::TriangularView<Eigen::Matrix<double, 3, 3>, 1>; typename Eigen::internal::traits<T>::Scalar = double]'
  398 |     TriangularViewType&  operator/=(const typename internal::traits<MatrixType>::Scalar& other) { return *this = derived().nestedExpression() / other; }
      |                                                                                                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:455:40:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:20:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator*=(const Scalar&) [with Derived = Eigen::Matrix<double, 3, 1>; Scalar = double]'
   20 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:463:14:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 2, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 2, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 2, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Array<double, 2, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::Array<double, 2, 1> >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Array<double, 2, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Array.h:45:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, 2, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:34:67:   required from 'Derived& Eigen::ArrayBase<Derived>::operator-=(const Scalar&) [with Derived = Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >; Scalar = double]'
   34 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::sub_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:777:34:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 2, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 2, 2> >; MatrixType = Eigen::Matrix<double, 2, 2>]'
  777 |     scaledMat.diagonal().array() -= shift;
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 2, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:41:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator/=(const Scalar&) [with Derived = Eigen::Matrix<double, 2, 2>; Scalar = double]'
   41 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::div_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:780:17:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 2, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 2, 2> >; MatrixType = Eigen::Matrix<double, 2, 2>]'
  780 |       scaledMat /= scale;
      |       ~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, -1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, -1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, -1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, -1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, -1>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:451:40:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 3, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 3, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 3, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Array<double, 3, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::Array<double, 3, 1> >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Array<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Array.h:45:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:34:67:   required from 'Derived& Eigen::ArrayBase<Derived>::operator-=(const Scalar&) [with Derived = Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >; Scalar = double]'
   34 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::sub_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:670:34:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  670 |     scaledMat.diagonal().array() -= shift;
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:41:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator/=(const Scalar&) [with Derived = Eigen::Matrix<double, 3, 3>; Scalar = double]'
   41 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::div_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:672:29:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  672 |     if(scale > 0) scaledMat /= scale;   // TODO for scale==0 we could save the remaining operations
      |                   ~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:640:28:   required from 'static bool Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::extract_kernel(MatrixType&, Eigen::Ref<typename SolverType::RealVectorType>, Eigen::Ref<typename SolverType::RealVectorType>) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>; typename SolverType::RealVectorType = Eigen::Matrix<double, 3, 1>; typename Eigen::internal::conditional<typename SolverType::RealVectorType::IsVectorAtCompileTime, Eigen::InnerStride<1>, Eigen::OuterStride<> >::type = Eigen::InnerStride<1>]'
  640 |     mat.diagonal().cwiseAbs().maxCoeff(&i0);
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:704:25:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:648:23:   required from 'static bool Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::extract_kernel(MatrixType&, Eigen::Ref<typename SolverType::RealVectorType>, Eigen::Ref<typename SolverType::RealVectorType>) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>; typename SolverType::RealVectorType = Eigen::Matrix<double, 3, 1>; typename Eigen::internal::conditional<typename SolverType::RealVectorType::IsVectorAtCompileTime, Eigen::InnerStride<1>, Eigen::OuterStride<> >::type = Eigen::InnerStride<1>]'
  648 |     if(n0>n1) res = c0/sqrt(n0);
      |                     ~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:704:25:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 2, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:846:33:   required from 'static Derived& Eigen::internal::setIdentity_impl<Derived, Big>::run(Derived&) [with Derived = Eigen::Matrix<double, 2, 2>; bool Big = false]'
  846 |     return m = Derived::Identity(m.rows(), m.cols());
      |                ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:875:50:   required from 'Derived& Eigen::MatrixBase<Derived>::setIdentity() [with Derived = Eigen::Matrix<double, 2, 2>]'
  875 |   return internal::setIdentity_impl<Derived>::run(derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:790:27:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:370:46:   required from 'void Eigen::internal::tridiagonalization_inplace(MatrixType&, CoeffVectorType&) [with MatrixType = Eigen::Matrix<double, 2, 2>; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  370 |                                   * (conj(h) * matA.col(i).tail(remainingSize)));
      |                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:449:31:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, -1, 1, 0, 2, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, -1, 1, 0, 2, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 1, 0, 2, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:370:35:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:846:33:   required from 'static Derived& Eigen::internal::setIdentity_impl<Derived, Big>::run(Derived&) [with Derived = Eigen::Matrix<double, 3, 3>; bool Big = false]'
  846 |     return m = Derived::Identity(m.rows(), m.cols());
      |                ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:875:50:   required from 'Derived& Eigen::MatrixBase<Derived>::setIdentity() [with Derived = Eigen::Matrix<double, 3, 3>]'
  875 |   return internal::setIdentity_impl<Derived>::run(derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:683:27:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Matrix<double, 3, 1>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:646:68:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:44:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>; U = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:147:18:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, -1, 1, 0, 3, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, -1, 1, 0, 3, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 1, 0, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28:   required from 'struct Eigen::internal::traits<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:131:14:   required from 'const Eigen::MatrixBase<Derived>::PlainObject Eigen::MatrixBase<Derived>::normalized() const [with Derived = Eigen::Matrix<double, 2, 1>; PlainObject = Eigen::Matrix<double, 2, 1>]'
  131 |     return n / numext::sqrt(z);
      |            ~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/OrthoMethods.h:211:80:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:268:7:   required from 'Eigen::MapBase<Derived, 1>::ScalarWithConstIfNotLvalue& Eigen::MapBase<Derived, 1>::coeffRef(Eigen::Index) [with Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>; ScalarWithConstIfNotLvalue = double; Eigen::Index = long long int]'
   15 |       EIGEN_STATIC_ASSERT((int(internal::evaluator<Derived>::Flags) & LinearAccessBit) || Derived::IsVectorAtCompileTime, \
      |                                                              ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:367:25:   required from 'void Eigen::internal::tridiagonalization_inplace(MatrixType&, CoeffVectorType&) [with MatrixType = Eigen::Matrix<double, 2, 2>; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  367 |     matA.col(i).coeffRef(i+1) = 1;
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:449:31:   required from 'static void Eigen::internal::tridiagonalization_inplace_selector<MatrixType, Size, IsComplex>::run(MatrixType&, DiagonalType&, SubDiagonalType&, CoeffVectorType&, bool) [with DiagonalType = Eigen::Matrix<double, 2, 1>; SubDiagonalType = Eigen::Matrix<double, 1, 1, 0, 1, 1>; MatrixType = Eigen::Matrix<double, 2, 2>; int Size = 2; bool IsComplex = false; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  449 |     tridiagonalization_inplace(mat, hCoeffs);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:434:55:   required from 'void Eigen::internal::tridiagonalization_inplace(MatrixType&, DiagonalType&, SubDiagonalType&, CoeffVectorType&, bool) [with MatrixType = Eigen::Matrix<double, 2, 2>; DiagonalType = Eigen::Matrix<double, 2, 1>; SubDiagonalType = Eigen::Matrix<double, 1, 1, 0, 1, 1>; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  434 |   tridiagonalization_inplace_selector<MatrixType>::run(mat, diag, subdiag, hcoeffs, extractQ);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:458:39:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:475:5:   required from 'void Eigen::internal::apply_rotation_in_the_plane(Eigen::DenseBase<Derived>&, Eigen::DenseBase<Derived>&, const Eigen::JacobiRotation<OtherScalar>&) [with VectorX = Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>; VectorY = Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>; OtherScalar = double]'
  475 |     EIGEN_PLAIN_ENUM_MIN(evaluator<VectorX>::Alignment, evaluator<VectorY>::Alignment),
      |                                              ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:315:40:   required from 'void Eigen::MatrixBase<Derived>::applyOnTheRight(Eigen::Index, Eigen::Index, const Eigen::JacobiRotation<OtherScalar>&) [with OtherScalar = double; Derived = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >; Eigen::Index = long long int]'
  315 |   internal::apply_rotation_in_the_plane(x, y, j.transpose());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:895:24:   required from 'void Eigen::internal::tridiagonal_qr_step(RealScalar*, RealScalar*, Index, Index, Scalar*, Index) [with int StorageOrder = 0; RealScalar = double; Scalar = double; Index = long long int]'
  895 |       q.applyOnTheRight(k,k+1,rot);
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:548:87:   required from 'Eigen::ComputationInfo Eigen::internal::computeFromTridiagonal_impl(DiagType&, SubDiagType&, Eigen::Index, bool, MatrixType&) [with MatrixType = Eigen::Matrix<double, 2, 2>; DiagType = Eigen::Matrix<double, 2, 1>; SubDiagType = Eigen::Matrix<double, 1, 1, 0, 1, 1>; Eigen::Index = long long int]'
  548 |     internal::tridiagonal_qr_step<MatrixType::Flags&RowMajorBit ? RowMajor : ColMajor>(diag.data(), subdiag.data(), start, end, computeEigenvectors ? eivec.data() : (Scalar*)0, n);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:460:49:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:79:51:   required from 'class Eigen::internal::visitor_evaluator<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false> >'
   79 |     CoeffReadCost = internal::evaluator<XprType>::CoeffReadCost
      |                                                   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:123:17:   required from 'void Eigen::DenseBase<Derived>::visit(Visitor&) const [with Visitor = Eigen::internal::min_coeff_visitor<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>, 0>; Derived = Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>]'
  123 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:323:14:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::minCoeff(IndexType*) const [with int NaNPropagation = 0; IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  323 |   this->visit(minVisitor);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:496:37:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::minCoeff(IndexType*) const [with IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  496 |       return minCoeff<PropagateFast>(index);
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:563:35:   required from 'Eigen::ComputationInfo Eigen::internal::computeFromTridiagonal_impl(DiagType&, SubDiagType&, Eigen::Index, bool, MatrixType&) [with MatrixType = Eigen::Matrix<double, 2, 2>; DiagType = Eigen::Matrix<double, 2, 1>; SubDiagType = Eigen::Matrix<double, 1, 1, 0, 1, 1>; Eigen::Index = long long int]'
  563 |       diag.segment(i,n-i).minCoeff(&k);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:460:49:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:79:51:   required from 'class Eigen::internal::visitor_evaluator<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >'
   79 |     CoeffReadCost = internal::evaluator<XprType>::CoeffReadCost
      |                                                   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:123:17:   required from 'void Eigen::DenseBase<Derived>::visit(Visitor&) const [with Visitor = Eigen::internal::min_coeff_visitor<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 0>; Derived = Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>]'
  123 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:323:14:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::minCoeff(IndexType*) const [with int NaNPropagation = 0; IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  323 |   this->visit(minVisitor);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:496:37:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::minCoeff(IndexType*) const [with IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  496 |       return minCoeff<PropagateFast>(index);
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:563:35:   required from 'Eigen::ComputationInfo Eigen::internal::computeFromTridiagonal_impl(DiagType&, SubDiagType&, Eigen::Index, bool, MatrixType&) [with MatrixType = Eigen::Matrix<double, 3, 3>; DiagType = Eigen::Matrix<double, 3, 1>; SubDiagType = Eigen::Matrix<double, 2, 1>; Eigen::Index = long long int]'
  563 |       diag.segment(i,n-i).minCoeff(&k);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:460:49:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:200:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_3(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  199 |     CGAL::Default_diagonalize_traits<double, 3>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:137:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  137 |       compute_axes_3(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, 3, 3>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, 3, 3>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, -1, -1, 0, 3, 3> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 0, 3, 3> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:175:44:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:96:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:101:66:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:175:44:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:102:66:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:22:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:176:44:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  176 |       m_best_v->fitness() = compute_fitness(best_m, m_points, m_traits);
      |                             ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 2, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 2, 1>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 2, 1> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Matrix<double, 2, 1>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:128:31:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:93:22:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholder(EssentialPart&, Scalar&, RealScalar&) const [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   93 |     essential = tail / (c0 - beta);
      |                 ~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:46:18:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:44:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; U = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:34:74:   required from 'static void Eigen::internal::selfadjoint_rank2_update_selector<Scalar, Index, UType, VType, 1>::run(Scalar*, Index, const UType&, const VType&, const Scalar&) [with Scalar = double; Index = long long int; UType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; VType = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>]'
   34 |                         (numext::conj(alpha) * numext::conj(u.coeff(i))) * v.tail(size-i)
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:87:10:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:35:60:   required from 'static void Eigen::internal::selfadjoint_rank2_update_selector<Scalar, Index, UType, VType, 1>::run(Scalar*, Index, const UType&, const VType&, const Scalar&) [with Scalar = double; Index = long long int; UType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; VType = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>]'
   35 |                       + (alpha * numext::conj(v.coeff(i))) * u.tail(size-i);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:87:10:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1, 0, 1, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:35:23:   required from 'static void Eigen::internal::selfadjoint_rank2_update_selector<Scalar, Index, UType, VType, 1>::run(Scalar*, Index, const UType&, const VType&, const Scalar&) [with Scalar = double; Index = long long int; UType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; VType = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>]'
   34 |                         (numext::conj(alpha) * numext::conj(u.coeff(i))) * v.tail(size-i)
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   35 |                       + (alpha * numext::conj(v.coeff(i))) * u.tail(size-i);
      |                       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:87:10:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 1, -1, 1, 1, 3> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 1, -1, 1, 1, 3> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 1, -1, 1, 1, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:38:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:41:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:131:25:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; Scalar = double]'
  131 |     this->row(0) -= tau * tmp;
      |                     ~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/HouseholderQR.h:296:35:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:132:29:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; Scalar = double]'
  132 |     bottom.noalias() -= tau * essential * tmp;
      |                         ~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/HouseholderQR.h:296:35:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 0, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:132:41:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:63:90:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:63:57:   required from 'void Eigen::internal::make_block_householder_triangular_factor(TriangularFactorType&, const VectorsType&, const CoeffsType&) [with TriangularFactorType = Eigen::Matrix<double, -1, -1, 1, -1, -1>; VectorsType = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; CoeffsType = Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>]'
   63 |       triFactor.row(i).tail(rt).noalias() = -hCoeffs(i) * vectors.col(i).tail(rs).adjoint()
      |                                             ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 5>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 5>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 5>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 5>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 5>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 5>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:64:57:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:73:50:   required from 'void Eigen::internal::make_block_householder_triangular_factor(TriangularFactorType&, const VectorsType&, const CoeffsType&) [with TriangularFactorType = Eigen::Matrix<double, -1, -1, 1, -1, -1>; VectorsType = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; CoeffsType = Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>]'
   73 |           triFactor.row(i).tail(nbVecs-j-1) += z * triFactor.row(j).tail(nbVecs-j-1);
      |                                                ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:78:71:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:142:7:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::coeff(Eigen::Index) const [with Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; CoeffReturnType = const double&; Eigen::Index = long long int]'
  142 |       EIGEN_STATIC_ASSERT(internal::evaluator<Derived>::Flags & LinearAccessBit,
      |                                                         ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:79:20:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholder(EssentialPart&, Scalar&, RealScalar&) const [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   79 |   Scalar c0 = coeff(0);
      |               ~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:46:18:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholderInPlace(Scalar&, RealScalar&) [with Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   46 |   makeHouseholder(essentialPart, tau, beta);
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:363:59:   required from 'void Eigen::internal::tridiagonalization_inplace(MatrixType&, CoeffVectorType&) [with MatrixType = Eigen::Matrix<double, 2, 2>; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  363 |     matA.col(i).tail(remainingSize).makeHouseholderInPlace(h, beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:449:31:   required from 'static void Eigen::internal::tridiagonalization_inplace_selector<MatrixType, Size, IsComplex>::run(MatrixType&, DiagonalType&, SubDiagonalType&, CoeffVectorType&, bool) [with DiagonalType = Eigen::Matrix<double, 2, 1>; SubDiagonalType = Eigen::Matrix<double, 1, 1, 0, 1, 1>; MatrixType = Eigen::Matrix<double, 2, 2>; int Size = 2; bool IsComplex = false; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  449 |     tridiagonalization_inplace(mat, hCoeffs);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:434:55:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:115:7:   required from 'const Eigen::MapBase<Derived, 0>::Scalar& Eigen::MapBase<Derived, 0>::coeff(Eigen::Index) const [with Derived = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Scalar = double; Eigen::Index = long long int]'
   15 |       EIGEN_STATIC_ASSERT((int(internal::evaluator<Derived>::Flags) & LinearAccessBit) || Derived::IsVectorAtCompileTime, \
      |                                                              ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:35:54:   required from 'static void Eigen::internal::selfadjoint_rank2_update_selector<Scalar, Index, UType, VType, 1>::run(Scalar*, Index, const UType&, const VType&, const Scalar&) [with Scalar = double; Index = long long int; UType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; VType = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>]'
   35 |                       + (alpha * numext::conj(v.coeff(i))) * u.tail(size-i);
      |                                               ~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:87:10:   required from 'Eigen::SelfAdjointView<MatrixType, UpLo>& Eigen::SelfAdjointView<MatrixType, Mode>::rankUpdate(const Eigen::MatrixBase<OtherDerived>&, const Eigen::MatrixBase<OtherDerived>&, const Scalar&) [with DerivedU = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; DerivedV = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; _MatrixType = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; unsigned int UpLo = 1; Scalar = double]'
   85 |   internal::selfadjoint_rank2_update_selector<Scalar, Index, UType, VType,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   86 |     (IsRowMajor ? int(UpLo==Upper ? Lower : Upper) : UpLo)>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   87 |     ::run(_expression().const_cast_derived().data(),_expression().outerStride(),UType(actualU),VType(actualV),actualAlpha);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:375:18:   required from 'void Eigen::internal::tridiagonalization_inplace(MatrixType&, CoeffVectorType&) [with MatrixType = Eigen::Matrix<double, 2, 2>; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  374 |     matA.bottomRightCorner(remainingSize, remainingSize).template selfadjointView<Lower>()
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |       .rankUpdate(matA.col(i).tail(remainingSize), hCoeffs.tail(remainingSize), Scalar(-1));
      |       ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:449:31:   required from 'static void Eigen::internal::tridiagonalization_inplace_selector<MatrixType, Size, IsComplex>::run(MatrixType&, DiagonalType&, SubDiagonalType&, CoeffVectorType&, bool) [with DiagonalType = Eigen::Matrix<double, 2, 1>; SubDiagonalType = Eigen::Matrix<double, 1, 1, 0, 1, 1>; MatrixType = Eigen::Matrix<double, 2, 2>; int Size = 2; bool IsComplex = false; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  449 |     tridiagonalization_inplace(mat, hCoeffs);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:434:55:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:93:22:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholder(EssentialPart&, Scalar&, RealScalar&) const [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1>; Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   93 |     essential = tail / (c0 - beta);
      |                 ~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:46:18:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:20:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator*=(const Scalar&) [with Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; Scalar = double]'
   20 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:123:11:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; Scalar = double]'
  123 |     *this *= Scalar(1)-tau;
      |     ~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/HouseholderQR.h:296:35:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:156:20:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  156 |         nelder_mead(m_population[s], nelder_mead_iterations, m_points, m_traits);
      |         ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:86:22:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:78:71:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1043:41:   required from 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
 1043 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:142:7:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::coeff(Eigen::Index) const [with Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>; CoeffReturnType = const double&; Eigen::Index = long long int]'
  142 |       EIGEN_STATIC_ASSERT(internal::evaluator<Derived>::Flags & LinearAccessBit,
      |                                                         ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:79:20:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholder(EssentialPart&, Scalar&, RealScalar&) const [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1>; Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   79 |   Scalar c0 = coeff(0);
      |               ~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:46:18:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholderInPlace(Scalar&, RealScalar&) [with Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   46 |   makeHouseholder(essentialPart, tau, beta);
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/HouseholderQR.h:291:58:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:117:45:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::genetic_algorithm() [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  117 |         offspring[j] = Vertex{m_traits.get_Q(lambda*lm + rambda*rm), m_points, m_traits};
      |                               ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1043:41:   required from 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
 1043 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:142:7:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::coeff(Eigen::Index) const [with Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>; CoeffReturnType = const double&; Eigen::Index = long long int]'
  142 |       EIGEN_STATIC_ASSERT(internal::evaluator<Derived>::Flags & LinearAccessBit,
      |                                                         ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:79:20:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholder(EssentialPart&, Scalar&, RealScalar&) const [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1>; Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   79 |   Scalar c0 = coeff(0);
      |               ~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:46:18:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholderInPlace(Scalar&, RealScalar&) [with Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   46 |   makeHouseholder(essentialPart, tau, beta);
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/HouseholderQR.h:291:58:   required from 'void Eigen::internal::householder_qr_inplace_unblocked(MatrixQR&, HCoeffs&, typename MatrixQR::Scalar*) [with MatrixQR = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; HCoeffs = Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>; typename MatrixQR::Scalar = double]'
  291 |     mat.col(k).tail(remainingRows).makeHouseholderInPlace(hCoeffs.coeffRef(k), beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/HouseholderQR.h:345:39:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:142:7:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::coeff(Eigen::Index) const [with Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>; CoeffReturnType = const double&; Eigen::Index = long long int]'
  142 |       EIGEN_STATIC_ASSERT(internal::evaluator<Derived>::Flags & LinearAccessBit,
      |                                                         ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:79:20:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholder(EssentialPart&, Scalar&, RealScalar&) const [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1>; Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   79 |   Scalar c0 = coeff(0);
      |               ~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:46:18:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholderInPlace(Scalar&, RealScalar&) [with Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   46 |   makeHouseholder(essentialPart, tau, beta);
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/HouseholderQR.h:291:58:   required from 'void Eigen::internal::householder_qr_inplace_unblocked(MatrixQR&, HCoeffs&, typename MatrixQR::Scalar*) [with MatrixQR = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; HCoeffs = Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>; typename MatrixQR::Scalar = double]'
  291 |     mat.col(k).tail(remainingRows).makeHouseholderInPlace(hCoeffs.coeffRef(k), beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/HouseholderQR.h:345:39:   required from 'static void Eigen::internal::householder_qr_inplace_blocked<MatrixQR, HCoeffs, MatrixQRScalar, InnerStrideIsOne>::run(MatrixQR&, HCoeffs&, Eigen::Index, typename MatrixQR::Scalar*) [with MatrixQR = Eigen::Matrix<double, 3, 3>; HCoeffs = Eigen::Matrix<double, 3, 1>; MatrixQRScalar = double; bool InnerStrideIsOne = true; Eigen::Index = long long int; typename MatrixQR::Scalar = double]'
  345 |       householder_qr_inplace_unblocked(A11_21, hCoeffsSegment, tempData);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/HouseholderQR.h:416:73:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:564:45:   required from 'struct Eigen::internal::unary_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  564 |     CoeffReadCost = int(evaluator<ArgType>::CoeffReadCost) + int(functor_traits<UnaryOp>::Cost),
      |                                             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:86:22:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, -1, 3>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, -1, 3>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, -1, 3>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, -1, -1, 0, -1, 3> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 0, -1, 3> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>; SrcXprType = Eigen::Matrix<double, 2, 1>; Functor = assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>; SrcXprType = Eigen::Matrix<double, 2, 1>; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>; Src = Eigen::Matrix<double, 2, 1>; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>; Src = Eigen::Matrix<double, 2, 1>; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>; Src = Eigen::Matrix<double, 2, 1>]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Assign.h:66:28:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:16:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:166:45:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:51:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; U = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   required from 'typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType Eigen::MatrixBase<Derived>::dot(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType = double; typename Eigen::internal::traits<T>::Scalar = double; typename Eigen::internal::traits<OtherDerived>::Scalar = double]'
   84 |   return internal::dot_nocheck<Derived,OtherDerived>::run(*this, other);
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:372:86:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:564:45:   required from 'struct Eigen::internal::unary_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  564 |     CoeffReadCost = int(evaluator<ArgType>::CoeffReadCost) + int(functor_traits<UnaryOp>::Cost),
      |                                             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:416:50:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:46:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:78:71:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholder(EssentialPart&, Scalar&, RealScalar&) const [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   78 |   RealScalar tailSqNorm = size()==1 ? RealScalar(0) : tail.squaredNorm();
      |                                                       ~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:46:18:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1>, -1, 1, false>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41:   required from 'struct Eigen::internal::binary_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; SrcXprType = Eigen::CwiseNullaryOp<scalar_constant_op<double>, Eigen::Matrix<double, -1, -1, 0, 3, 3> >; Functor = mul_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; SrcXprType = Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, -1, -1, 0, 3, 3> >; Functor = Eigen::internal::mul_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; Src = Eigen::CwiseNullaryOp<scalar_constant_op<double>, Eigen::Matrix<double, -1, -1, 0, 3, 3> >; Func = mul_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; Src = Eigen::CwiseNullaryOp<scalar_constant_op<double>, Eigen::Matrix<double, -1, -1, 0, 3, 3> >; Func = mul_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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:20:28:   required from 'Derived& Eigen::DenseBase<Derived>::operator*=(const Scalar&) [with Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; Scalar = double]'
   20 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:123:11:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false>; Functor = add_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false>; Functor = Eigen::internal::add_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false>; Func = add_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false>; Func = add_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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:177:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator+=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false>; Derived = Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >]'
  177 |   call_assignment(derived(), other.derived(), internal::add_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:130:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false> >'
 1043 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; 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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; Functor = add_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; 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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; Functor = add_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; 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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; Functor = Eigen::internal::add_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 3, 3>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; SrcXprType = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >; Functor = assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; SrcXprType = Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Assign.h:66:28:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:337:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h: In instantiation of 'static void Eigen::internal::selfadjoint_matrix_vector_product<Scalar, Index, StorageOrder, UpLo, ConjugateLhs, ConjugateRhs, Version>::run(Index, const Scalar*, Index, const Scalar*, Scalar*, Scalar) [with Scalar = double; Index = long long int; int StorageOrder = 0; int UpLo = 1; bool ConjugateLhs = false; bool ConjugateRhs = false; int Version = 0]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:229:7:   required from 'static void Eigen::internal::selfadjoint_product_impl<Lhs, LhsMode, false, Rhs, 0, true>::run(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; int LhsMode = 17; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Scalar = double]'
  227 |     internal::selfadjoint_matrix_vector_product<Scalar, Index, (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  228 |                                                 int(LhsUpLo), bool(LhsBlasTraits::NeedToConjugate), bool(RhsBlasTraits::NeedToConjugate)>::run
      |                                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  229 |       (
      |       ^
  230 |         lhs.rows(),                             // size
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  231 |         &lhs.coeffRef(0,0),  lhs.outerStride(), // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  232 |         actualRhsPtr,                           // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  233 |         actualDestPtr,                          // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  234 |         actualAlpha                             // scale factor
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  235 |       );
      |       ~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:805:109:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::SelfAdjointShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; int ProductTag = 3; Scalar = double]'
  805 |     selfadjoint_product_impl<typename Lhs::MatrixType,Lhs::Mode,false,Rhs,0,Rhs::IsVectorAtCompileTime>::run(dst, lhs.nestedExpression(), rhs, alpha);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Derived = Eigen::internal::generic_product_impl<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, Eigen::SelfAdjointShape, Eigen::DenseShape, 3>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:33:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Derived = Eigen::internal::generic_product_impl<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, Eigen::SelfAdjointShape, Eigen::DenseShape, 3>]'
  349 |   { dst.setZero(); scaleAndAddTo(dst, lhs, rhs, Scalar(1)); }
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::Product<Lhs, Rhs, Options>, Eigen::internal::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::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; int Options = 0; Scalar = double; SrcXprType = Eigen::Product<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>]'
  148 |     generic_product_impl<Lhs, Rhs>::evalTo(dst, src.lhs(), src.rhs());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:62:121: warning: ignoring attributes on template argument 'Eigen::internal::packet_traits<double>::type' {aka '__m128d'} [-Wignored-attributes]
   62 |   conj_helper<Packet,Packet,NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(ConjugateLhs,  IsRowMajor), ConjugateRhs> pcj0;
      |                                                                                                                         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:62:121: warning: ignoring attributes on template argument 'Eigen::internal::packet_traits<double>::type' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:63:121: warning: ignoring attributes on template argument 'Eigen::internal::packet_traits<double>::type' {aka '__m128d'} [-Wignored-attributes]
   63 |   conj_helper<Packet,Packet,NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(ConjugateLhs, !IsRowMajor), ConjugateRhs> pcj1;
      |                                                                                                                         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:63:121: warning: ignoring attributes on template argument 'Eigen::internal::packet_traits<double>::type' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 2, 2>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:46:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:78:71:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholder(EssentialPart&, Scalar&, RealScalar&) const [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1>; Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   78 |   RealScalar tailSqNorm = size()==1 ? RealScalar(0) : tail.squaredNorm();
      |                                                       ~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:46:18:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:16:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:330:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of 'class Eigen::internal::gebp_traits<double, double, false, false, 1, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:92:29:   required from 'struct Eigen::internal::product_triangular_matrix_matrix<double, long long int, 5, true, 0, false, 0, false, 0, 1, 0>'
   92 |     SmallPanelWidth   = 2 * EIGEN_PLAIN_ENUM_MAX(Traits::mr,Traits::nr),
      |                                                          ^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; int ProductTag = 3; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, Eigen::TriangularShape, Eigen::DenseShape, 3>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::subTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, Eigen::TriangularShape, Eigen::DenseShape, 3>]'
  357 |   { scaleAndAddTo(dst, lhs, rhs, Scalar(-1)); }
      |     ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                                              ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; typename Dest::Scalar = double]'
  457 |         dst.topRows(diagSize) -= ((lhs_alpha-LhsScalar(1))*a_rhs).topRows(diagSize);
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, -1, -1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, -1, -1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, -1, -1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:74:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; typename Dest::Scalar = double]'
  462 |         dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:27:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:169:25:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Scalar = double]'
  169 |     this->col(0) -= tau * tmp;
      |                     ~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:53:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 0, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:34:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:41:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:132:29:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Scalar = double]'
  132 |     bottom.noalias() -= tau * essential * tmp;
      |                         ~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 0, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:132:41:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 3, 1>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:166:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/Memory.h: In instantiation of 'Index Eigen::internal::first_default_aligned(const Scalar*, Index) [with Scalar = double; Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:89:68:   required from 'static void Eigen::internal::selfadjoint_matrix_vector_product<Scalar, Index, StorageOrder, UpLo, ConjugateLhs, ConjugateRhs, Version>::run(Index, const Scalar*, Index, const Scalar*, Scalar*, Scalar) [with Scalar = double; Index = long long int; int StorageOrder = 0; int UpLo = 1; bool ConjugateLhs = false; bool ConjugateRhs = false; int Version = 0]'
   89 |     Index alignedStart = (starti) + internal::first_default_aligned(&res[starti], endi-starti);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:229:7:   required from 'static void Eigen::internal::selfadjoint_product_impl<Lhs, LhsMode, false, Rhs, 0, true>::run(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; int LhsMode = 17; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Scalar = double]'
  227 |     internal::selfadjoint_matrix_vector_product<Scalar, Index, (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  228 |                                                 int(LhsUpLo), bool(LhsBlasTraits::NeedToConjugate), bool(RhsBlasTraits::NeedToConjugate)>::run
      |                                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  229 |       (
      |       ^
  230 |         lhs.rows(),                             // size
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  231 |         &lhs.coeffRef(0,0),  lhs.outerStride(), // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  232 |         actualRhsPtr,                           // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  233 |         actualDestPtr,                          // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  234 |         actualAlpha                             // scale factor
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  235 |       );
      |       ~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:805:109:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::SelfAdjointShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; int ProductTag = 3; Scalar = double]'
  805 |     selfadjoint_product_impl<typename Lhs::MatrixType,Lhs::Mode,false,Rhs,0,Rhs::IsVectorAtCompileTime>::run(dst, lhs.nestedExpression(), rhs, alpha);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Derived = Eigen::internal::generic_product_impl<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, Eigen::SelfAdjointShape, Eigen::DenseShape, 3>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:33:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Derived = Eigen::internal::generic_product_impl<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, Eigen::SelfAdjointShape, Eigen::DenseShape, 3>]'
  349 |   { dst.setZero(); scaleAndAddTo(dst, lhs, rhs, Scalar(1)); }
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/Memory.h:500:60: warning: ignoring attributes on template argument 'Eigen::internal::packet_traits<double>::type' {aka '__m128d'} [-Wignored-attributes]
  500 |   return first_aligned<unpacket_traits<DefaultPacketType>::alignment>(array, size);
      |                                                            ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, 2, 2>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, 2, 2>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, -1, -1, 0, 2, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 0, 2, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, 2, 2> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:27:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:169:25:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Scalar = double]'
  169 |     this->col(0) -= tau * tmp;
      |                     ~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:53:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:34:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 1, -1, 1, 1, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 1, -1, 1, 1, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 1, -1, 1, 1, 2> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:41:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:131:25:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Scalar = double]'
  131 |     this->row(0) -= tau * tmp;
      |                     ~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:132:29:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Scalar = double]'
  132 |     bottom.noalias() -= tau * essential * tmp;
      |                         ~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:132:41:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>; SrcXprType = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> > >; Functor = assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>; SrcXprType = Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> > >; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> > >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> > >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> > >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Assign.h:66:28:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, Eigen::Dense>'
  372 |   typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type;
      |                                                                                                      ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:527:76:   required from 'struct Eigen::internal::product_evaluator<Eigen::Product<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 1>, 3, Eigen::DenseShape, Eigen::DenseShape, double, double>'
  527 |   typedef typename internal::nested_eval<Rhs,Lhs::RowsAtCompileTime>::type RhsNested;
      |                                                                            ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:29:8:   required from 'struct Eigen::internal::evaluator<Eigen::Product<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 1> >'
   29 | struct evaluator<Product<Lhs, Rhs, Options> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Product<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 1>; Functor = assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Product<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 1>; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3>, -1, -1, false>, -1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3>, -1, -1, false>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3>, -1, -1, false>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:32:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:48:   required from 'static void Eigen::internal::triangular_product_impl<Mode, false, Lhs, true, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; int Mode = 5; Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >; Rhs = const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; typename Dest::Scalar = double]'
  194 |             ::run(rhs.transpose(),lhs.transpose(), dstT, alpha);
      |                                   ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:783:113:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 64>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 8, 8, 0, 8, 8> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 8, 8, 0, 8, 8> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 8, 8, 0, 8, 8>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:150:68:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  150 |     Matrix<Scalar,SmallPanelWidth,SmallPanelWidth,LhsStorageOrder> triangularBuffer(a);
      |                                                                    ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 8, 8, 0, 8, 8> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 8, 8, 0, 8, 8> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 8, 8, 0, 8, 8> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:153:32:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 8>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:153:32:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  153 |       triangularBuffer.diagonal().setZero();
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of 'class Eigen::internal::gebp_traits<double, double, false, false, 1, 1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1080:42:   required from 'struct Eigen::internal::gebp_kernel<double, double, long long int, Eigen::internal::blas_data_mapper<double, long long int, 0, 0, 1>, 4, 4, false, false>'
 1080 |   typedef typename HalfTraits::LhsPacket LhsPacketHalf;
      |                                          ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:157:103:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  157 |     gebp_kernel<Scalar, Scalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp_kernel;
      |                                                                                                       ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; int ProductTag = 3; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, Eigen::TriangularShape, Eigen::DenseShape, 3>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                                              ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of 'class Eigen::internal::gebp_traits<double, double, false, false, 1, 2>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1085:45:   required from 'struct Eigen::internal::gebp_kernel<double, double, long long int, Eigen::internal::blas_data_mapper<double, long long int, 0, 0, 1>, 4, 4, false, false>'
 1085 |   typedef typename QuarterTraits::LhsPacket LhsPacketQuarter;
      |                                             ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:157:103:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  157 |     gebp_kernel<Scalar, Scalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp_kernel;
      |                                                                                                       ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; int ProductTag = 3; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, Eigen::TriangularShape, Eigen::DenseShape, 3>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                                              ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 3, 3>, 1, 3, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:176:44:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  176 |       m_best_v->fitness() = compute_fitness(best_m, m_points, m_traits);
      |                             ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:37:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:176:44:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  176 |       m_best_v->fitness() = compute_fitness(best_m, m_points, m_traits);
      |                             ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 3, 1>, 3, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:176:44:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  176 |       m_best_v->fitness() = compute_fitness(best_m, m_points, m_traits);
      |                             ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>; Rhs = Eigen::Matrix<double, 3, 1>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Matrix<double, 3, 3>; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Matrix<double, 3, 1>; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:176:44:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  176 |       m_best_v->fitness() = compute_fitness(best_m, m_points, m_traits);
      |                             ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:20:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator*=(const Scalar&) [with Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Scalar = double]'
   20 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:161:11:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Scalar = double]'
  161 |     *this *= Scalar(1)-tau;
      |     ~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:175:44:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:96:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:101:66:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:102:66:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:22:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/BlasUtil.h:506:13:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/VectorBlock.h:56:47:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:341:54:   required from 'static void Eigen::internal::trmv_selector<Mode, 1>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false> >; Rhs = Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >; Dest = Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; int Mode = 6; typename Dest::Scalar = double]'
  341 |       dest.head(diagSize) -= (lhs_alpha-LhsScalar(1))*rhs.head(diagSize);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:18:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 3, 3>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 3, 3>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 3, 3>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 3, 3>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 3, 3>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 3, 3>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1, 0, 3, 3>; int Mode = 6; bool LhsIsTriangular = true; Lhs = const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >; Rhs = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; typename Dest::Scalar = double]'
  457 |         dst.topRows(diagSize) -= ((lhs_alpha-LhsScalar(1))*a_rhs).topRows(diagSize);
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:74:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 3, 3>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 3, 3>, -1, -1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 3, 3>, -1, -1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 3, 3>, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 3, 3>, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 3, 3>, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 3, 3> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 3, 3> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 3, 3> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 3, 3> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 3, 3> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 3, 3> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 3, 3> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1, 0, 3, 3>; int Mode = 6; bool LhsIsTriangular = true; Lhs = const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >; Rhs = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; typename Dest::Scalar = double]'
  462 |         dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 1, 3, 3>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 1, 3, 3>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 1, 3, 3>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, -1, -1, 1, 3, 3> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 1, 3, 3> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 1, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 long int; DataMapper = Eigen::internal::const_blas_data_mapper<double, long long int, 0>; int nr = 4; bool Conjugate = false; bool PanelMode = false]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:175:15:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  175 |       pack_rhs(blockB, rhs.getSubMapper(actual_k2,0), actual_kc, cols);
      |       ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; int ProductTag = 3; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, Eigen::TriangularShape, Eigen::DenseShape, 3>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::subTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, Eigen::TriangularShape, Eigen::DenseShape, 3>]'
  357 |   { scaleAndAddTo(dst, lhs, rhs, Scalar(-1)); }
      |     ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                              ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 long int; DataMapper = Eigen::internal::const_blas_data_mapper<double, long long int, 0>; int Pack1 = 4; int Pack2 = 2; Packet = __vector(2) double; bool Conjugate = false; bool PanelMode = false]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:203:19:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  203 |           pack_lhs(blockA, LhsMapper(triangularBuffer.data(), triangularBuffer.outerStride()), actualPanelWidth, actualPanelWidth);
      |           ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; int ProductTag = 3; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, Eigen::TriangularShape, Eigen::DenseShape, 3>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::subTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, Eigen::TriangularShape, Eigen::DenseShape, 3>]'
  357 |   { scaleAndAddTo(dst, lhs, rhs, Scalar(-1)); }
      |     ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                  ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                              ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 long int; DataMapper = Eigen::internal::blas_data_mapper<double, long long int, 0, 0, 1>; int mr = 4; int nr = 4; bool ConjugateLhs = false; bool ConjugateRhs = false; ResScalar = double]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:205:22:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  205 |           gebp_kernel(res.getSubMapper(startBlock, 0), blockA, blockB,
      |           ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  206 |                       actualPanelWidth, actualPanelWidth, cols, alpha,
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                       actualPanelWidth, actual_kc, 0, blockBOffset);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; int ProductTag = 3; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, Eigen::TriangularShape, Eigen::DenseShape, 3>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::subTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 3, 3>, Eigen::TriangularShape, Eigen::DenseShape, 3>]'
  357 |   { scaleAndAddTo(dst, lhs, rhs, Scalar(-1)); }
      |     ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                       ^~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                          ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:63:90:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:63:57:   required from 'void Eigen::internal::make_block_householder_triangular_factor(TriangularFactorType&, const VectorsType&, const CoeffsType&) [with TriangularFactorType = Eigen::Matrix<double, -1, -1, 1, -1, -1>; VectorsType = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1>]'
   63 |       triFactor.row(i).tail(rt).noalias() = -hCoeffs(i) * vectors.col(i).tail(rs).adjoint()
      |                                             ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 5>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 5>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 5>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 5>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 5>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 5>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:64:57:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                                               ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:115:18:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                                               ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:119:18:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:137:106:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, 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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_product_op<double, double>, 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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, 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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:137:77:   required from 'static void Eigen::internal::triangular_matrix_vector_product<Index, Mode, LhsScalar, ConjLhs, RhsScalar, ConjRhs, 1, Version>::run(Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, const ResScalar&) [with Index = long long int; int Mode = 6; LhsScalar = double; bool ConjLhs = false; RhsScalar = double; bool ConjRhs = false; int Version = 0; ResScalar = double]'
  137 |           res.coeffRef(i) += alpha * (cjLhs.row(i).segment(s,r).cwiseProduct(cjRhs.segment(s,r).transpose())).sum();
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:332:12:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:333:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of 'class Eigen::internal::gemv_traits<double, double, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:306:38:   required from 'struct Eigen::internal::general_matrix_vector_product<long long int, double, Eigen::internal::const_blas_data_mapper<double, long long int, 1>, 1, false, double, Eigen::internal::const_blas_data_mapper<double, long long int, 1>, false, 1>'
  306 |   typedef typename Traits::LhsPacket LhsPacket;
      |                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:145:123:   required from 'static void Eigen::internal::triangular_matrix_vector_product<Index, Mode, LhsScalar, ConjLhs, RhsScalar, ConjRhs, 1, Version>::run(Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, const ResScalar&) [with Index = long long int; int Mode = 6; LhsScalar = double; bool ConjLhs = false; RhsScalar = double; bool ConjRhs = false; int Version = 0; ResScalar = double]'
  145 |         general_matrix_vector_product<Index,LhsScalar,LhsMapper,RowMajor,ConjLhs,RhsScalar,RhsMapper,ConjRhs,BuiltIn>::run(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  146 |             actualPanelWidth, r,
      |             ~~~~~~~~~~~~~~~~~~~~                                                                                           
  147 |             LhsMapper(&lhs.coeffRef(pi,s), lhsStride),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                     
  148 |             RhsMapper(&rhs.coeffRef(s), rhsIncr),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                          
  149 |             &res.coeffRef(pi), resIncr, alpha);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                             
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:332:12:   required from 'static void Eigen::internal::trmv_selector<Mode, 1>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false> >; Rhs = Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >; Dest = Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; int Mode = 6; typename Dest::Scalar = double]'
  327 |     internal::triangular_matrix_vector_product
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  328 |       <Index,Mode,
      |       ~~~~~~~~~~~~
  329 |        LhsScalar, LhsBlasTraits::NeedToConjugate,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  330 |        RhsScalar, RhsBlasTraits::NeedToConjugate,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  331 |        RowMajor>
      |        ~~~~~~~~~
  332 |       ::run(actualLhs.rows(),actualLhs.cols(),
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  333 |             actualLhs.data(),actualLhs.outerStride(),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  334 |             actualRhsPtr,1,
      |             ~~~~~~~~~~~~~~~
  335 |             dest.data(),dest.innerStride(),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  336 |             actualAlpha);
      |             ~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:18:   required from 'static void Eigen::internal::triangular_product_impl<Mode, false, Lhs, true, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; int Mode = 5; Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >; Rhs = const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; typename Dest::Scalar = double]'
  192 |     internal::trmv_selector<(Mode & (UnitDiag|ZeroDiag)) | ((Mode & Lower) ? Upper : Lower),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |                             (int(internal::traits<Rhs>::Flags)&RowMajorBit) ? ColMajor : RowMajor>
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  194 |             ::run(rhs.transpose(),lhs.transpose(), dstT, alpha);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:783:113:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::TriangularShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >; Rhs = Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 5>; int ProductTag = 3; Scalar = double]'
  783 |     triangular_product_impl<Rhs::Mode,false,Lhs,Lhs::RowsAtCompileTime==1, typename Rhs::MatrixType, false>::run(dst, lhs, rhs.nestedExpression(), alpha);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                                     ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                      ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                          ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                                                                  ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of 'class Eigen::internal::gemv_traits<double, double, 1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:310:42:   required from 'struct Eigen::internal::general_matrix_vector_product<long long int, double, Eigen::internal::const_blas_data_mapper<double, long long int, 1>, 1, false, double, Eigen::internal::const_blas_data_mapper<double, long long int, 1>, false, 1>'
  310 |   typedef typename HalfTraits::LhsPacket LhsPacketHalf;
      |                                          ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:145:123:   required from 'static void Eigen::internal::triangular_matrix_vector_product<Index, Mode, LhsScalar, ConjLhs, RhsScalar, ConjRhs, 1, Version>::run(Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, const ResScalar&) [with Index = long long int; int Mode = 6; LhsScalar = double; bool ConjLhs = false; RhsScalar = double; bool ConjRhs = false; int Version = 0; ResScalar = double]'
  145 |         general_matrix_vector_product<Index,LhsScalar,LhsMapper,RowMajor,ConjLhs,RhsScalar,RhsMapper,ConjRhs,BuiltIn>::run(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  146 |             actualPanelWidth, r,
      |             ~~~~~~~~~~~~~~~~~~~~                                                                                           
  147 |             LhsMapper(&lhs.coeffRef(pi,s), lhsStride),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                     
  148 |             RhsMapper(&rhs.coeffRef(s), rhsIncr),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                          
  149 |             &res.coeffRef(pi), resIncr, alpha);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                             
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:332:12:   required from 'static void Eigen::internal::trmv_selector<Mode, 1>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false> >; Rhs = Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >; Dest = Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; int Mode = 6; typename Dest::Scalar = double]'
  327 |     internal::triangular_matrix_vector_product
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  328 |       <Index,Mode,
      |       ~~~~~~~~~~~~
  329 |        LhsScalar, LhsBlasTraits::NeedToConjugate,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  330 |        RhsScalar, RhsBlasTraits::NeedToConjugate,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  331 |        RowMajor>
      |        ~~~~~~~~~
  332 |       ::run(actualLhs.rows(),actualLhs.cols(),
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  333 |             actualLhs.data(),actualLhs.outerStride(),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  334 |             actualRhsPtr,1,
      |             ~~~~~~~~~~~~~~~
  335 |             dest.data(),dest.innerStride(),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  336 |             actualAlpha);
      |             ~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:18:   required from 'static void Eigen::internal::triangular_product_impl<Mode, false, Lhs, true, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; int Mode = 5; Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >; Rhs = const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; typename Dest::Scalar = double]'
  192 |     internal::trmv_selector<(Mode & (UnitDiag|ZeroDiag)) | ((Mode & Lower) ? Upper : Lower),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |                             (int(internal::traits<Rhs>::Flags)&RowMajorBit) ? ColMajor : RowMajor>
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  194 |             ::run(rhs.transpose(),lhs.transpose(), dstT, alpha);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:783:113:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::TriangularShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >; Rhs = Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 5>; int ProductTag = 3; Scalar = double]'
  783 |     triangular_product_impl<Rhs::Mode,false,Lhs,Lhs::RowsAtCompileTime==1, typename Rhs::MatrixType, false>::run(dst, lhs, rhs.nestedExpression(), alpha);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                                     ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                      ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                          ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                                                                  ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of 'class Eigen::internal::gemv_traits<double, double, 2>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:314:45:   required from 'struct Eigen::internal::general_matrix_vector_product<long long int, double, Eigen::internal::const_blas_data_mapper<double, long long int, 1>, 1, false, double, Eigen::internal::const_blas_data_mapper<double, long long int, 1>, false, 1>'
  314 |   typedef typename QuarterTraits::LhsPacket LhsPacketQuarter;
      |                                             ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:145:123:   required from 'static void Eigen::internal::triangular_matrix_vector_product<Index, Mode, LhsScalar, ConjLhs, RhsScalar, ConjRhs, 1, Version>::run(Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, const ResScalar&) [with Index = long long int; int Mode = 6; LhsScalar = double; bool ConjLhs = false; RhsScalar = double; bool ConjRhs = false; int Version = 0; ResScalar = double]'
  145 |         general_matrix_vector_product<Index,LhsScalar,LhsMapper,RowMajor,ConjLhs,RhsScalar,RhsMapper,ConjRhs,BuiltIn>::run(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  146 |             actualPanelWidth, r,
      |             ~~~~~~~~~~~~~~~~~~~~                                                                                           
  147 |             LhsMapper(&lhs.coeffRef(pi,s), lhsStride),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                     
  148 |             RhsMapper(&rhs.coeffRef(s), rhsIncr),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                          
  149 |             &res.coeffRef(pi), resIncr, alpha);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                             
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:332:12:   required from 'static void Eigen::internal::trmv_selector<Mode, 1>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false> >; Rhs = Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >; Dest = Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; int Mode = 6; typename Dest::Scalar = double]'
  327 |     internal::triangular_matrix_vector_product
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  328 |       <Index,Mode,
      |       ~~~~~~~~~~~~
  329 |        LhsScalar, LhsBlasTraits::NeedToConjugate,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  330 |        RhsScalar, RhsBlasTraits::NeedToConjugate,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  331 |        RowMajor>
      |        ~~~~~~~~~
  332 |       ::run(actualLhs.rows(),actualLhs.cols(),
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  333 |             actualLhs.data(),actualLhs.outerStride(),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  334 |             actualRhsPtr,1,
      |             ~~~~~~~~~~~~~~~
  335 |             dest.data(),dest.innerStride(),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  336 |             actualAlpha);
      |             ~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:18:   required from 'static void Eigen::internal::triangular_product_impl<Mode, false, Lhs, true, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; int Mode = 5; Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >; Rhs = const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; typename Dest::Scalar = double]'
  192 |     internal::trmv_selector<(Mode & (UnitDiag|ZeroDiag)) | ((Mode & Lower) ? Upper : Lower),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |                             (int(internal::traits<Rhs>::Flags)&RowMajorBit) ? ColMajor : RowMajor>
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  194 |             ::run(rhs.transpose(),lhs.transpose(), dstT, alpha);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:783:113:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::TriangularShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >; Rhs = Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 5>; int ProductTag = 3; Scalar = double]'
  783 |     triangular_product_impl<Rhs::Mode,false,Lhs,Lhs::RowsAtCompileTime==1, typename Rhs::MatrixType, false>::run(dst, lhs, rhs.nestedExpression(), alpha);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                                     ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                      ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                          ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                                                                  ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 8, 8, 1, 8, 8> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 8, 8, 1, 8, 8> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 8, 8, 1, 8, 8> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:153:32:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 8, 8, 0, 8, 8> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 8, 8, 0, 8, 8> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 8, 8, 0, 8, 8> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 8, 8, 0, 8, 8> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Matrix<double, 8, 8, 0, 8, 8>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Matrix<double, 8, 8, 0, 8, 8>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:151:29:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 8, 1, 0, 8, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 8, 1, 0, 8, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 8, 1, 0, 8, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 8, 1, 0, 8, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:153:42:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 3, 3>, 3, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:156:20:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  156 |         nelder_mead(m_population[s], nelder_mead_iterations, m_points, m_traits);
      |         ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>; Rhs = Eigen::Matrix<double, 3, 3>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Matrix<double, 3, 3>; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Matrix<double, 3, 3>; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:156:20:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  156 |         nelder_mead(m_population[s], nelder_mead_iterations, m_points, m_traits);
      |         ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:176:44:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  176 |       m_best_v->fitness() = compute_fitness(best_m, m_points, m_traits);
      |                             ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:176:44:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  176 |       m_best_v->fitness() = compute_fitness(best_m, m_points, m_traits);
      |                             ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618:37:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618: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) const [with Lhs = Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >; Rhs = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  618 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of 'void Eigen::internal::gemm_pack_lhs<Scalar, Index, DataMapper, Pack1, Pack2, Packet, 1, Conjugate, PanelMode>::operator()(Scalar*, const DataMapper&, Index, Index, Index, Index) [with Scalar = double; Index = long long int; DataMapper = Eigen::internal::const_blas_data_mapper<double, long long int, 1>; int Pack1 = 4; int Pack2 = 2; Packet = __vector(2) double; bool Conjugate = false; bool PanelMode = false]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:203:19:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 6; int LhsStorageOrder = 1; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  203 |           pack_lhs(blockA, LhsMapper(triangularBuffer.data(), triangularBuffer.outerStride()), actualPanelWidth, actualPanelWidth);
      |           ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1, 0, 3, 3>; int Mode = 6; bool LhsIsTriangular = true; Lhs = const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >; Rhs = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix<double, -1, -1, 0, 3, 3>; Lhs = Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, 6>; Rhs = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; int ProductTag = 3; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Matrix<double, -1, -1, 0, 3, 3>; Lhs = Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, 6>; Rhs = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, Eigen::TriangularShape, Eigen::DenseShape, 3>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:33:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix<double, -1, -1, 0, 3, 3>; Lhs = Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, 6>; Rhs = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, Eigen::TriangularShape, Eigen::DenseShape, 3>]'
  349 |   { dst.setZero(); scaleAndAddTo(dst, lhs, rhs, Scalar(1)); }
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2256:82: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
 2256 |   typedef typename unpacket_traits<typename unpacket_traits<Packet>::half>::half QuarterPacket;
      |                                                                                  ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2258:56: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
 2258 |          HalfPacketSize = unpacket_traits<HalfPacket>::size,
      |                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2259:62: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
 2259 |          QuarterPacketSize = unpacket_traits<QuarterPacket>::size,
      |                                                              ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2259:62: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2298:39: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
 2298 |               PacketBlock<HalfPacket> kernel_half;
      |                                       ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2298:39: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2304:42: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
 2304 |               PacketBlock<QuarterPacket> kernel_quarter;
      |                                          ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2304:42: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2304:42: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2304:42: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:416:50:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:416:50:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 3, 1>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:142:7:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::coeff(Eigen::Index) const [with Derived = Eigen::Block<const Eigen::Matrix<double, 3, 1>, -1, 1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  142 |       EIGEN_STATIC_ASSERT(internal::evaluator<Derived>::Flags & LinearAccessBit,
      |                                                         ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:182:19:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::operator()(Eigen::Index) const [with Derived = Eigen::Block<const Eigen::Matrix<double, 3, 1>, -1, 1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  182 |       return coeff(index);
      |              ~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:63:53:   required from 'void Eigen::internal::make_block_householder_triangular_factor(TriangularFactorType&, const VectorsType&, const CoeffsType&) [with TriangularFactorType = Eigen::Matrix<double, -1, -1, 1, -1, -1>; VectorsType = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, 3, 1>, -1>]'
   63 |       triFactor.row(i).tail(rt).noalias() = -hCoeffs(i) * vectors.col(i).tail(rs).adjoint()
      |                                              ~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, 3, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, 3, 3>; Workspace = Eigen::Matrix<double, 3, 1>; VectorsType = Eigen::Matrix<double, 3, 3>; CoeffsType = Eigen::Matrix<double, 3, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:320:29:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:416:50:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:416:50:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:142:7:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::coeff(Eigen::Index) const [with Derived = Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  142 |       EIGEN_STATIC_ASSERT(internal::evaluator<Derived>::Flags & LinearAccessBit,
      |                                                         ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:182:19:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::operator()(Eigen::Index) const [with Derived = Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  182 |       return coeff(index);
      |              ~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:63:53:   required from 'void Eigen::internal::make_block_householder_triangular_factor(TriangularFactorType&, const VectorsType&, const CoeffsType&) [with TriangularFactorType = Eigen::Matrix<double, -1, -1, 1, -1, -1>; VectorsType = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1>]'
   63 |       triFactor.row(i).tail(rt).noalias() = -hCoeffs(i) * vectors.col(i).tail(rs).adjoint()
      |                                              ~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, 2, 2>; Workspace = Eigen::Matrix<double, 2, 1>; VectorsType = Eigen::Matrix<double, 2, 2>; CoeffsType = Eigen::Matrix<double, 1, 1, 0, 1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:320:29:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:37:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >; Rhs = Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >; int ProductTag = 4; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/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>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/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>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, 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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, 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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 8, 8, 1, 8, 8> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 8, 8, 1, 8, 8> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 8, 8, 1, 8, 8> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 8, 8, 1, 8, 8> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Matrix<double, 8, 8, 1, 8, 8>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Matrix<double, 8, 8, 1, 8, 8>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:151:29:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Matrix<double, -1, -1, 0, -1, 3>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Matrix<double, -1, -1, 0, -1, 3>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:16:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 1, 0, 8, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 1, 0, 8, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 1, 0, 8, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 8, 1, 0, 8, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 8, 1, 0, 8, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 8, 1, 0, 8, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, -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, 0, 3, 3> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, -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, 0, 3, 3> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, -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, 0, 3, 3> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true> >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, -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, 0, 3, 3> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, -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, 0, 3, 3> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true> >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, -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, 0, 3, 3> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true> >; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, true>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:32:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 1, -1, false>; Functor = add_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 1, -1, false>; Functor = Eigen::internal::add_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 1, -1, false>; Func = add_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 1, -1, false>; Func = add_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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:177:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator+=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, 1, -1, false>; Derived = Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >]'
  177 |   call_assignment(derived(), other.derived(), internal::add_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:130:9:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:156:20:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  156 |         nelder_mead(m_population[s], nelder_mead_iterations, m_points, m_traits);
      |         ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>; SrcXprType = Eigen::CwiseNullaryOp<scalar_constant_op<double>, Eigen::Matrix<double, -1, -1, 0, 2, 2> >; Functor = mul_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>; SrcXprType = Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, -1, -1, 0, 2, 2> >; Functor = Eigen::internal::mul_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>; Src = Eigen::CwiseNullaryOp<scalar_constant_op<double>, Eigen::Matrix<double, -1, -1, 0, 2, 2> >; Func = mul_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>; Src = Eigen::CwiseNullaryOp<scalar_constant_op<double>, Eigen::Matrix<double, -1, -1, 0, 2, 2> >; Func = mul_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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:20:28:   required from 'Derived& Eigen::DenseBase<Derived>::operator*=(const Scalar&) [with Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Scalar = double]'
   20 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:161:11:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>; Functor = add_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>; Functor = Eigen::internal::add_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>; Func = add_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>; Func = add_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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:177:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator+=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>; Derived = Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >]'
  177 |   call_assignment(derived(), other.derived(), internal::add_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:168:9:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>; Functor = add_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>; Functor = Eigen::internal::add_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>; Func = add_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>; Func = add_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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:177:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator+=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>; Derived = Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >]'
  177 |   call_assignment(derived(), other.derived(), internal::add_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:130:9:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, -1, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, -1, 2>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, -1, 2>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, -1, -1, 0, -1, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 0, -1, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, 2> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 3>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 3>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 3>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 3>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 3>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 3>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 3>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 3>, -1, -1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 3>, -1, -1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 3>, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 3>, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 3>, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1, 0, -1, 3>; int Mode = 2; bool LhsIsTriangular = true; Lhs = Eigen::Matrix<double, -1, -1, 1, -1, -1>; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; typename Dest::Scalar = double]'
  462 |         dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1, 0, -1, 3>; int Mode = 1; bool LhsIsTriangular = true; Lhs = const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >; Rhs = Eigen::Matrix<double, -1, -1, 0, 3, 3>; typename Dest::Scalar = double]'
  462 |         dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, 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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:137:114:   required from 'static void Eigen::internal::triangular_matrix_vector_product<Index, Mode, LhsScalar, ConjLhs, RhsScalar, ConjRhs, 1, Version>::run(Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, const ResScalar&) [with Index = long long int; int Mode = 6; LhsScalar = double; bool ConjLhs = false; RhsScalar = double; bool ConjRhs = false; int Version = 0; ResScalar = double]'
  137 |           res.coeffRef(i) += alpha * (cjLhs.row(i).segment(s,r).cwiseProduct(cjRhs.segment(s,r).transpose())).sum();
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:332:12:   required from 'static void Eigen::internal::trmv_selector<Mode, 1>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false> >; Rhs = Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >; Dest = Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; int Mode = 6; typename Dest::Scalar = double]'
  327 |     internal::triangular_matrix_vector_product
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  328 |       <Index,Mode,
      |       ~~~~~~~~~~~~
  329 |        LhsScalar, LhsBlasTraits::NeedToConjugate,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  330 |        RhsScalar, RhsBlasTraits::NeedToConjugate,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  331 |        RowMajor>
      |        ~~~~~~~~~
  332 |       ::run(actualLhs.rows(),actualLhs.cols(),
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  333 |             actualLhs.data(),actualLhs.outerStride(),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  334 |             actualRhsPtr,1,
      |             ~~~~~~~~~~~~~~~
  335 |             dest.data(),dest.innerStride(),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  336 |             actualAlpha);
      |             ~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:18:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1043:41:   required from 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
 1043 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   [ skipping 34 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 32 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; 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, 0, 3, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; 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, 0, 3, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Derived = Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:341:27:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 3, 3>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 3, 3>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 3, 3>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 3, 3> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 3, 3> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3>, -1, -1, true>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, 3, 3> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3>, -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, 1, 3, 3> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 3, 3>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3>, -1, -1, true>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, 3, 3> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false> >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3>, -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, 1, 3, 3> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3>, -1, -1, true>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, 3, 3> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false> >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3>, -1, -1, true>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, 3, 3> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 3, 3> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false> >, -1, -1, false> >; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 3, 3>, -1, -1, true>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:32:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, Eigen::Dense>'
  372 |   typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type;
      |                                                                                                      ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:527:76:   required from 'struct Eigen::internal::product_evaluator<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, 1>, 3, Eigen::DenseShape, Eigen::DenseShape, double, double>'
  527 |   typedef typename internal::nested_eval<Rhs,Lhs::RowsAtCompileTime>::type RhsNested;
      |                                                                            ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:29:8:   required from 'struct Eigen::internal::evaluator<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, 1> >'
   29 | struct evaluator<Product<Lhs, Rhs, Options> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, 1>; Functor = assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, 1>; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 3, 1, true>, -1, 1, false>; SrcXprType = Eigen::CwiseNullaryOp<scalar_constant_op<double>, Eigen::Matrix<double, -1, 1, 0, 3, 1> >; Functor = assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 3, 1, true>, -1, 1, false>; SrcXprType = Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, -1, 1, 0, 3, 1> >; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 3, 1, true>, -1, 1, false>; Src = Eigen::CwiseNullaryOp<scalar_constant_op<double>, Eigen::Matrix<double, -1, 1, 0, 3, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 3, 1, true>, -1, 1, false>; Src = Eigen::CwiseNullaryOp<scalar_constant_op<double>, Eigen::Matrix<double, -1, 1, 0, 3, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, -1, 1, false>; Src = Eigen::CwiseNullaryOp<scalar_constant_op<double>, Eigen::Matrix<double, -1, 1, 0, 3, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Assign.h:66:28:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Dense>'
  372 |   typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type;
      |                                                                                                      ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:526:76:   required from 'struct Eigen::internal::product_evaluator<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>, 3, Eigen::DenseShape, Eigen::DenseShape, double, double>'
  526 |   typedef typename internal::nested_eval<Lhs,Rhs::ColsAtCompileTime>::type LhsNested;
      |                                                                            ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:29:8:   required from 'struct Eigen::internal::evaluator<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1> >'
   29 | struct evaluator<Product<Lhs, Rhs, Options> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>; Functor = assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, Eigen::Dense>'
  372 |   typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type;
      |                                                                                                      ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:527:76:   required from 'struct Eigen::internal::product_evaluator<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>, 3, Eigen::DenseShape, Eigen::DenseShape, double, double>'
  527 |   typedef typename internal::nested_eval<Rhs,Lhs::RowsAtCompileTime>::type RhsNested;
      |                                                                            ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:29:8:   required from 'struct Eigen::internal::evaluator<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1> >'
   29 | struct evaluator<Product<Lhs, Rhs, Options> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>; Functor = assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; 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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618:75:   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) const [with Lhs = Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >; Rhs = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  618 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61:   required from 'void Eigen::internal::generic_dense_assignment_kernel<DstEvaluatorTypeT, SrcEvaluatorTypeT, Functor, Version>::assignCoeff(Eigen::Index) [with DstEvaluatorTypeT = Eigen::internal::evaluator<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> > >; SrcEvaluatorTypeT = Eigen::internal::evaluator<Eigen::Product<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, -1, false>, 1> >; Functor = Eigen::internal::assign_op<double, double>; int Version = 0; Eigen::Index = long long int]'
  660 |     m_functor.assignCoeff(m_dst.coeffRef(index), m_src.coeff(index));
      |                                                  ~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:518:25:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1, 0, 2, 2>; typename Dest::Scalar = double]'
  457 |         dst.topRows(diagSize) -= ((lhs_alpha-LhsScalar(1))*a_rhs).topRows(diagSize);
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:74:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1, 0, 2, 2>; typename Dest::Scalar = double]'
  462 |         dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>, -1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:32:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:48:   required from 'static void Eigen::internal::triangular_product_impl<Mode, false, Lhs, true, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; int Mode = 5; Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >; Rhs = const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; typename Dest::Scalar = double]'
  194 |             ::run(rhs.transpose(),lhs.transpose(), dstT, alpha);
      |                                   ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:783:113:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618:37:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618: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) const [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >; Rhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  618 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618:37:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618: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) const [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; Rhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  618 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/BlasUtil.h:506:13:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/VectorBlock.h:56:47:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:341:54:   required from 'static void Eigen::internal::trmv_selector<Mode, 1>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >; Rhs = Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >; Dest = Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; int Mode = 6; typename Dest::Scalar = double]'
  341 |       dest.head(diagSize) -= (lhs_alpha-LhsScalar(1))*rhs.head(diagSize);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:18:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1, 0, 2, 2>; int Mode = 6; bool LhsIsTriangular = true; Lhs = const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >; Rhs = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; typename Dest::Scalar = double]'
  457 |         dst.topRows(diagSize) -= ((lhs_alpha-LhsScalar(1))*a_rhs).topRows(diagSize);
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:74:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1, 0, 2, 2>; int Mode = 6; bool LhsIsTriangular = true; Lhs = const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >; Rhs = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; typename Dest::Scalar = double]'
  462 |         dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 1, 2, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 1, 2, 2>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 1, 2, 2>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, -1, -1, 1, 2, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 1, 2, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 1, 2, 2> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 3>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 3>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 3>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 3>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 3>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 3>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 3>, -1, -1, true>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 3>, -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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 3>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 3>, -1, -1, true>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 3>, -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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 3>, -1, -1, true>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 3>, -1, -1, true>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 3>, -1, -1, true>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:32:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 3>, -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<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 3>, -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<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618:37:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618: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) const [with Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  618 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > >; Rhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >; int ProductTag = 4; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 3, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 3, 1>, 0, Eigen::Stride<0, 0> > >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618:37:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618: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) const [with Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  618 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:37:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >; Rhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; int ProductTag = 4; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; Rhs = Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >; int ProductTag = 4; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 29 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, -1, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, -1, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 29 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 29 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Matrix<double, -1, -1, 0, -1, 2>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Matrix<double, -1, -1, 0, -1, 2>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:16:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:32:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; 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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618:75:   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) const [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >; Rhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  618 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61:   required from 'void Eigen::internal::generic_dense_assignment_kernel<DstEvaluatorTypeT, SrcEvaluatorTypeT, Functor, Version>::assignCoeff(Eigen::Index) [with DstEvaluatorTypeT = Eigen::internal::evaluator<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 3>, 0, Eigen::Stride<0, 0> > >; SrcEvaluatorTypeT = Eigen::internal::evaluator<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false>, 1> >; Functor = Eigen::internal::assign_op<double, double>; int Version = 0; Eigen::Index = long long int]'
  660 |     m_functor.assignCoeff(m_dst.coeffRef(index), m_src.coeff(index));
      |                                                  ~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:518:25:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/internal/evolution.h:147:7:   required from 'void CGAL::Optimal_bounding_box::internal::Evolution<PointRange, Traits>::evolve(std::size_t, std::size_t, std::size_t, std::size_t) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::size_t = long long unsigned int]'
  147 |       genetic_algorithm();
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:130:25:   required from 'void CGAL::Optimal_bounding_box::internal::compute_best_transformation(const PointRange&, typename Traits::Aff_transformation_3&, typename Traits::Aff_transformation_3&, CGAL::Random&, const Traits&) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; typename Traits::Aff_transformation_3 = CGAL::Aff_transformation_3<CGAL::Epick>]'
  130 |   search_solution.evolve(max_generations, population_size, nelder_mead_iterations);
      |   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:174:30:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, Array&, CGAL::Random&, const Traits&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<CGAL::Point_3<CGAL::Epick> >; Array = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  174 |   compute_best_transformation(points, transformation, inverse_transformation, rng, traits);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:230:43:   required from 'void CGAL::Optimal_bounding_box::internal::construct_oriented_bounding_box(const PointRange&, bool, Output&, CGAL::Random&, const Traits&) [with PointRange = CGAL::Iterator_range<boost::iterators::transform_iterator<CGAL::Property_map_to_unary_function<CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >, __gnu_cxx::__normal_iterator<const CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick> > >, boost::use_default, boost::use_default> >; Output = std::array<CGAL::Point_3<CGAL::Epick>, 8>; Traits = CGAL::Oriented_bounding_box_traits_3<CGAL::Epick>]'
  230 |     return construct_oriented_bounding_box(ch_points, output, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h:371:73:   required from 'void CGAL::oriented_bounding_box(const PointRange&, Output&, const NamedParameters&, std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; Output = std::array<Point_3<Epick>, 8>; NamedParameters = Named_function_parameters<bool, internal_np::use_convex_hull_t, internal_np::No_property>; std::enable_if_t<((bool)boost::has_range_iterator<PointRange>::value)> = void]'
  371 |   return Optimal_bounding_box::internal::construct_oriented_bounding_box(
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  372 |            CGAL::make_range(
      |            ~~~~~~~~~~~~~~~~~                                             
  373 |              boost::make_transform_iterator(points.begin(), CGAL::Property_map_to_unary_function<PointMap>(point_map)),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  374 |              boost::make_transform_iterator(points.end(), CGAL::Property_map_to_unary_function<PointMap>(point_map))),
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |            use_ch, out, rng, traits);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~                                     
export_bounding.cpp:52:30:   required from here
   52 |   CGAL::oriented_bounding_box(points, obb_pts,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
   53 |                               CGAL::parameters::use_convex_hull(true));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; 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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618:75:   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) const [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; Rhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  618 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61:   required from 'void Eigen::internal::generic_dense_assignment_kernel<DstEvaluatorTypeT, SrcEvaluatorTypeT, Functor, Version>::assignCoeff(Eigen::Index) [with DstEvaluatorTypeT = Eigen::internal::evaluator<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > >; SrcEvaluatorTypeT = Eigen::internal::evaluator<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1> >; Functor = Eigen::internal::assign_op<double, double>; int Version = 0; Eigen::Index = long long int]'
  660 |     m_functor.assignCoeff(m_dst.coeffRef(index), m_src.coeff(index));
      |                                                  ~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:518:25:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 32 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 32 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1043:41:   required from 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
 1043 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   [ skipping 42 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 40 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; 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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, true>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, true>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, true>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, true>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:32:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, true>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, true>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, true>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:32:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
  151 |     bool res = diagonalize_selfadjoint_matrix(m, eigenvectors_, eigenvalues_);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:157:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2(double, double) [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  156 |     CGAL::Default_diagonalize_traits<double, 2>::diagonalize_selfadjoint_covariance_matrix
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |       (matrix, eigenvalues, eigenvectors);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h:135:7:   required from 'void CGAL::Approximate_min_ellipsoid_d<Traits>::compute_axes_2_3() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>]'
  135 |       compute_axes_2(alpha, factor);
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Approximate_min_ellipsoid_d.h:375:9:   required from 'CGAL::Approximate_min_ellipsoid_d<Traits>::Axes_lengths_iterator CGAL::Approximate_min_ellipsoid_d<Traits>::axes_lengths_begin() [with Traits = CGAL::Approximate_min_ellipsoid_d_traits_d<CGAL::Cartesian_d<double>, CGAL::MP_Float>; Axes_lengths_iterator = std::vector<double>::const_iterator]'
  375 |         compute_axes_2_3();
      |         ^~~~~~~~~~~~~~~~
export_bounding.cpp:108:62:   required from here
  108 |     AME::Axes_lengths_iterator al_ib = ame.axes_lengths_begin();
      |                                        ~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:341:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h: In function 'static void Eigen::internal::trmv_selector<Mode, 1>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, -1, false> >; Rhs = Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 3> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 3, 3>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >; Dest = Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; int Mode = 6]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:332:12: warning: 'result' may be used uninitialized [-Wmaybe-uninitialized]
  327 |     internal::triangular_matrix_vector_product
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  328 |       <Index,Mode,
      |       ~~~~~~~~~~~~
  329 |        LhsScalar, LhsBlasTraits::NeedToConjugate,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  330 |        RhsScalar, RhsBlasTraits::NeedToConjugate,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  331 |        RowMajor>
      |        ~~~~~~~~~
  332 |       ::run(actualLhs.rows(),actualLhs.cols(),
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  333 |             actualLhs.data(),actualLhs.outerStride(),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  334 |             actualRhsPtr,1,
      |             ~~~~~~~~~~~~~~~
  335 |             dest.data(),dest.innerStride(),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  336 |             actualAlpha);
      |             ~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:105:24: note: by argument 5 of type 'const double*' to 'static void Eigen::internal::triangular_matrix_vector_product<Index, Mode, LhsScalar, ConjLhs, RhsScalar, ConjRhs, 1, Version>::run(Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, const ResScalar&) [with Index = long long int; int Mode = 6; LhsScalar = double; bool ConjLhs = false; RhsScalar = double; bool ConjRhs = false; int Version = 0]' declared here
  105 | EIGEN_DONT_INLINE void triangular_matrix_vector_product<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ConjRhs,RowMajor,Version>
      |                        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
g++  -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.7/BH/include' -I'D:/RCompile/CRANpkg/lib/4.7/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"   -DCGAL_HEADER_ONLY=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c export_hausdorff.cpp -o export_hausdorff.o
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:205,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dimension.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Bbox_2.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic_classes.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
                 from SurfaceMesh.h:17,
                 from export_hausdorff.cpp:14:
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                       ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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) {
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:174:
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/bind.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian_converter.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Filtered_kernel.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:21:
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/property_map.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
                 from SurfaceMesh.h:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/std_thread.h:43,
                 from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/thread:45,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/config.h:428,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20:
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from export_hausdorff.cpp:17:
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/distance.h: In instantiation of 'double CGAL::Polygon_mesh_processing::max_distance_to_triangle_mesh(const PointRange&, const TriangleMesh&, const NamedParameters&) [with Concurrency_tag = CGAL::Sequential_tag; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointRange = std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>]':
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/distance.h:1189:56:   required from 'double CGAL::Polygon_mesh_processing::approximate_Hausdorff_distance(const TriangleMesh&, const TriangleMesh&, const NamedParameters1&, const NamedParameters2&) [with Concurrency_tag = CGAL::Sequential_tag; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters1 = CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_points_per_face_t, CGAL::Named_function_parameters<double, CGAL::internal_np::nb_points_per_area_unit_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_points_per_edge_t, CGAL::Named_function_parameters<double, CGAL::internal_np::nb_points_per_distance_unit_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_points_on_faces_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_points_on_edges_t, CGAL::Named_function_parameters<double, CGAL::internal_np::grid_spacing_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::do_sample_faces_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::do_sample_edges_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::do_sample_vertices_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::monte_carlo_sampling_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::grid_sampling_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::random_uniform_sampling_t, CGAL::internal_np::No_property> > > > > > > > > > > > >; NamedParameters2 = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>]'
 1189 |   return max_distance_to_triangle_mesh<Concurrency_tag>(sample_points, tm2, np2);
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
export_hausdorff.cpp:78:76:   required from here
   78 |     d = CGAL::to_double<K::FT>(PMP::approximate_Hausdorff_distance<PIA_TAG>(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   79 |       mesh1, mesh2, params));
      |       ~~~~~~~~~~~~~~~~~~~~~                                                 
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/distance.h:1128:18: warning: possibly dangling reference to a temporary [-Wdangling-reference]
 1128 |   const Point_3& hint = get(vpm, *vertices(tm).first);
      |                  ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/distance.h:1128:28: note: the temporary was destroyed at the end of the full expression 'boost::get<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Point_3<CGAL::Epick>&, CGAL::SM_Vertex_index>(vpm, ((boost::iterators::detail::iterator_facade_base<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Vertex_index>, CGAL::SM_Vertex_index, std::random_access_iterator_tag, CGAL::SM_Vertex_index, long long int, false, false>*)(& CGAL::vertices<Point_3<Epick> >((* & tm)).CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Vertex_index> >::std::pair<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Vertex_index> >.std::pair<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Vertex_index> >::first))->boost::iterators::detail::iterator_facade_base<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Vertex_index>, CGAL::SM_Vertex_index, std::random_access_iterator_tag, CGAL::SM_Vertex_index, long long int, false, false>::operator*())'
 1128 |   const Point_3& hint = get(vpm, *vertices(tm).first);
      |                         ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/distance.h: In instantiation of 'double CGAL::Polygon_mesh_processing::max_distance_to_triangle_mesh(const PointRange&, const TriangleMesh&, const NamedParameters&) [with Concurrency_tag = CGAL::Sequential_tag; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointRange = std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_points_per_face_t, CGAL::Named_function_parameters<double, CGAL::internal_np::nb_points_per_area_unit_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_points_per_edge_t, CGAL::Named_function_parameters<double, CGAL::internal_np::nb_points_per_distance_unit_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_points_on_faces_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_points_on_edges_t, CGAL::Named_function_parameters<double, CGAL::internal_np::grid_spacing_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::do_sample_faces_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::do_sample_edges_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::do_sample_vertices_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::monte_carlo_sampling_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::grid_sampling_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::random_uniform_sampling_t, CGAL::internal_np::No_property> > > > > > > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/distance.h:1189:56:   required from 'double CGAL::Polygon_mesh_processing::approximate_Hausdorff_distance(const TriangleMesh&, const TriangleMesh&, const NamedParameters1&, const NamedParameters2&) [with Concurrency_tag = CGAL::Sequential_tag; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters1 = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; NamedParameters2 = CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_points_per_face_t, CGAL::Named_function_parameters<double, CGAL::internal_np::nb_points_per_area_unit_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_points_per_edge_t, CGAL::Named_function_parameters<double, CGAL::internal_np::nb_points_per_distance_unit_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_points_on_faces_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_points_on_edges_t, CGAL::Named_function_parameters<double, CGAL::internal_np::grid_spacing_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::do_sample_faces_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::do_sample_edges_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::do_sample_vertices_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::monte_carlo_sampling_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::grid_sampling_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::random_uniform_sampling_t, CGAL::internal_np::No_property> > > > > > > > > > > > >]'
 1189 |   return max_distance_to_triangle_mesh<Concurrency_tag>(sample_points, tm2, np2);
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/distance.h:1212:68:   required from 'double CGAL::Polygon_mesh_processing::approximate_symmetric_Hausdorff_distance(const TriangleMesh&, const TriangleMesh&, const NamedParameters1&, const NamedParameters2&) [with Concurrency_tag = CGAL::Sequential_tag; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters1 = CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_points_per_face_t, CGAL::Named_function_parameters<double, CGAL::internal_np::nb_points_per_area_unit_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_points_per_edge_t, CGAL::Named_function_parameters<double, CGAL::internal_np::nb_points_per_distance_unit_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_points_on_faces_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_points_on_edges_t, CGAL::Named_function_parameters<double, CGAL::internal_np::grid_spacing_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::do_sample_faces_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::do_sample_edges_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::do_sample_vertices_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::monte_carlo_sampling_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::grid_sampling_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::random_uniform_sampling_t, CGAL::internal_np::No_property> > > > > > > > > > > > >; NamedParameters2 = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>]'
 1212 |                     approximate_Hausdorff_distance<Concurrency_tag>(tm2,tm1,np2,np1));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
export_hausdorff.cpp:75:86:   required from here
   75 |     d = CGAL::to_double<K::FT>(PMP::approximate_symmetric_Hausdorff_distance<PIA_TAG>(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   76 |       mesh1, mesh2, params));
      |       ~~~~~~~~~~~~~~~~~~~~~                                                           
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/distance.h:1128:18: warning: possibly dangling reference to a temporary [-Wdangling-reference]
 1128 |   const Point_3& hint = get(vpm, *vertices(tm).first);
      |                  ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/distance.h:1128:28: note: the temporary was destroyed at the end of the full expression 'boost::get<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Point_3<CGAL::Epick>&, CGAL::SM_Vertex_index>(vpm, ((boost::iterators::detail::iterator_facade_base<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Vertex_index>, CGAL::SM_Vertex_index, std::random_access_iterator_tag, CGAL::SM_Vertex_index, long long int, false, false>*)(& CGAL::vertices<Point_3<Epick> >((* & tm)).CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Vertex_index> >::std::pair<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Vertex_index> >.std::pair<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Vertex_index> >::first))->boost::iterators::detail::iterator_facade_base<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Vertex_index>, CGAL::SM_Vertex_index, std::random_access_iterator_tag, CGAL::SM_Vertex_index, long long int, false, false>::operator*())'
 1128 |   const Point_3& hint = get(vpm, *vertices(tm).first);
      |                         ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
g++  -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.7/BH/include' -I'D:/RCompile/CRANpkg/lib/4.7/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"   -DCGAL_HEADER_ONLY=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c export_mesh.cpp -o export_mesh.o
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:205,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dimension.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Bbox_2.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic_classes.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
                 from SurfaceMesh.h:17,
                 from export_mesh.cpp:14:
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                       ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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) {
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:174:
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/bind.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian_converter.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Filtered_kernel.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:21:
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/property_map.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
                 from SurfaceMesh.h:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/std_thread.h:43,
                 from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/thread:45,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/config.h:428,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20:
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
g++  -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.7/BH/include' -I'D:/RCompile/CRANpkg/lib/4.7/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"   -DCGAL_HEADER_ONLY=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c export_normals.cpp -o export_normals.o
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:205,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dimension.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Bbox_2.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic_classes.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
                 from SurfaceMesh.h:17,
                 from export_normals.cpp:14:
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                       ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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) {
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:174:
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/bind.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian_converter.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Filtered_kernel.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:21:
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/property_map.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
                 from SurfaceMesh.h:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/std_thread.h:43,
                 from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/thread:45,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/config.h:428,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20:
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:165:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<float, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<float> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46:   required from here
   24 |     ResAlignment = traits<Quaternion<float> >::Alignment
      |                                              ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:271:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<float, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<float, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<float> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<float>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3:   required from here
   27 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<double> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47:   required from here
   98 |     ResAlignment = traits<Quaternion<double> >::Alignment
      |                                               ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<double> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<double>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3:   required from here
  102 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, -1>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, -1, -1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_matrix.h:39:8:   required from 'struct CGAL::Eigen_matrix<double>'
   39 | struct Eigen_matrix
      |        ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:28:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                            ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, -1, -1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_matrix.h:39:8:   required from 'struct CGAL::Eigen_matrix<double>'
   39 | struct Eigen_matrix
      |        ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:28:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                            ^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, -1, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/SVDBase.h:274:22:   required from 'class Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >'
  274 |   SingularValuesType m_singularValues;
      |                      ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:488:60:   required from 'class Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2>'
  488 | template<typename _MatrixType, int QRPreconditioner> class JacobiSVD
      |                                                            ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:51:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                   ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 1, -1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:440:19:   required from 'class Eigen::ColPivHouseholderQR<Eigen::Matrix<double, -1, -1> >'
  440 |     RowVectorType m_temp;
      |                   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:246:10:   required from 'struct Eigen::internal::qr_preconditioner_impl<Eigen::Matrix<double, -1, -1>, 2, 0, true>'
  246 |   QRType m_qr;
      |          ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:609:110:   required from 'class Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2>'
  609 |     internal::qr_preconditioner_impl<MatrixType, QRPreconditioner, internal::PreconditionIfMoreColsThanRows> m_qr_precond_morecols;
      |                                                                                                              ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:51:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                   ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:37:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                      ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:60:44:   required from here
   60 |     return jacobiSvd.singularValues().array().abs().maxCoeff() /
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:60:50:   required from here
   60 |     return jacobiSvd.singularValues().array().abs().maxCoeff() /
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/scoped_ptr.hpp:13,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/adjacency_list.hpp:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:41,
                 from export_normals.cpp:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/scoped_ptr.hpp:63:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   63 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:679:37:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  679 |   RealScalar scale = matrix.cwiseAbs().template maxCoeff<PropagateNaN>();
      |                      ~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28:   required from 'struct Eigen::internal::traits<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, -1, -1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, -1, -1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, -1, -1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:691:29:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  691 |     m_scaledMatrix = matrix / scale;
      |                      ~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, -1, -1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, -1, -1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, -1, -1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, -1, -1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, -1, -1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:691:29:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  691 |     m_scaledMatrix = matrix / scale;
      |                      ~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::Matrix<double, -1, -1>, -1, -1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:697:32:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  697 |     m_workMatrix = matrix.block(0,0,m_diagSize,m_diagSize) / scale;
      |                    ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:697:60:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  697 |     m_workMatrix = matrix.block(0,0,m_diagSize,m_diagSize) / scale;
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:705:61:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  705 |   RealScalar maxDiagEntry = m_workMatrix.cwiseAbs().diagonal().maxCoeff();
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<Eigen::Matrix<double, -1, -1>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<Eigen::Matrix<double, -1, -1>, -1, 1, true, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:758:35:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  758 |       if(computeU()) m_matrixU.col(i) *= m_workMatrix.coeff(i,i)/a;
      |                      ~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_opposite_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:765:62:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  765 |       if(computeU() && (a<RealScalar(0))) m_matrixU.col(i) = -m_matrixU.col(i);
      |                                                              ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<Eigen::Matrix<double, -1, 1>, -1, 1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/VectorBlock.h:56:47:   required from 'class Eigen::VectorBlock<Eigen::Matrix<double, -1, 1>, -1>'
   56 | template<typename VectorType, int Size> class VectorBlock
      |                                               ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:777:65:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  777 |     RealScalar maxRemainingSingularValue = m_singularValues.tail(m_diagSize-i).maxCoeff(&pos);
      |                                            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Matrix<double, -1, -1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:228:33:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  228 |       m_adjoint = matrix.adjoint();
      |                   ~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:175:44:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:345:58:   required from 'class Eigen::TriangularViewImpl<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 1, Eigen::Dense>'
  345 | template<typename _MatrixType, unsigned int _Mode> class TriangularViewImpl<_MatrixType,_Mode,Dense>
      |                                                          ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:187:58:   required from 'class Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 1>'
  187 | template<typename _MatrixType, unsigned int _Mode> class TriangularView
      |                                                          ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:231:121:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  231 |       svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint();
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 2>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 2>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 2, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 2, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 2, 2> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 2, 2>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/misc/RealSvd2x2.h:25:26:   required from 'void Eigen::internal::real_2x2_jacobi_svd(const MatrixType&, Index, Index, Eigen::JacobiRotation<RealScalar>*, Eigen::JacobiRotation<RealScalar>*) [with MatrixType = Eigen::Matrix<double, -1, -1>; RealScalar = double; Index = long long int]'
   25 |   Matrix<RealScalar,2,2> m;
      |                          ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:730:42:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  730 |             internal::real_2x2_jacobi_svd(m_workMatrix, p, q, &j_left, &j_right);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<Eigen::Matrix<double, -1, -1>, 1, -1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:297:10:   required from 'void Eigen::MatrixBase<Derived>::applyOnTheLeft(Eigen::Index, Eigen::Index, const Eigen::JacobiRotation<OtherScalar>&) [with OtherScalar = double; Derived = Eigen::Matrix<double, -1, -1>; Eigen::Index = long long int]'
  297 |   RowXpr x(this->row(p));
      |          ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:733:40:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  733 |             m_workMatrix.applyOnTheLeft(p,q,j_left);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:20:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator*=(const Scalar&) [with Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>; Scalar = double]'
   20 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:758:39:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  758 |       if(computeU()) m_matrixU.col(i) *= m_workMatrix.coeff(i,i)/a;
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:297:21:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  297 |         dst.diagonal().setOnes();
      |         ~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:303:34:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:59:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                                            ~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/VectorBlock.h:56:47:   required from 'class Eigen::VectorBlock<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1>'
   56 | template<typename VectorType, int Size> class VectorBlock
      |                                               ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:310:26:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  310 |           dst.col(k).tail(rows()-k-1).setZero();
      |           ~~~~~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/VectorBlock.h:56:47:   required from 'class Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>'
   56 | template<typename VectorType, int Size> class VectorBlock
      |                                               ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:82:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |                                                                  ~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:297:10:   required from 'void Eigen::MatrixBase<Derived>::applyOnTheLeft(Eigen::Index, Eigen::Index, const Eigen::JacobiRotation<OtherScalar>&) [with OtherScalar = double; Derived = Eigen::Matrix<double, 2, 2>; Eigen::Index = long long int]'
  297 |   RowXpr x(this->row(p));
      |          ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/misc/RealSvd2x2.h:46:19:   required from 'void Eigen::internal::real_2x2_jacobi_svd(const MatrixType&, Index, Index, Eigen::JacobiRotation<RealScalar>*, Eigen::JacobiRotation<RealScalar>*) [with MatrixType = Eigen::Matrix<double, -1, -1>; RealScalar = double; Index = long long int]'
   46 |   m.applyOnTheLeft(0,1,rot1);
      |   ~~~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:730:42:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  730 |             internal::real_2x2_jacobi_svd(m_workMatrix, p, q, &j_left, &j_right);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 2>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>, 1>'
  223 | template<typename Derived> class MapBase<Derived, WriteAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:297:10:   required from 'void Eigen::MatrixBase<Derived>::applyOnTheLeft(Eigen::Index, Eigen::Index, const Eigen::JacobiRotation<OtherScalar>&) [with OtherScalar = double; Derived = Eigen::Matrix<double, 2, 2>; Eigen::Index = long long int]'
  297 |   RowXpr x(this->row(p));
      |          ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/misc/RealSvd2x2.h:46:19:   required from 'void Eigen::internal::real_2x2_jacobi_svd(const MatrixType&, Index, Index, Eigen::JacobiRotation<RealScalar>*, Eigen::JacobiRotation<RealScalar>*) [with MatrixType = Eigen::Matrix<double, -1, -1>; RealScalar = double; Index = long long int]'
   46 |   m.applyOnTheLeft(0,1,rot1);
      |   ~~~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:730:42:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  730 |             internal::real_2x2_jacobi_svd(m_workMatrix, p, q, &j_left, &j_right);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:277:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:475:5:   required from 'void Eigen::internal::apply_rotation_in_the_plane(Eigen::DenseBase<Derived>&, Eigen::DenseBase<Derived>&, const Eigen::JacobiRotation<OtherScalar>&) [with VectorX = Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>; VectorY = Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>; OtherScalar = double]'
  475 |     EIGEN_PLAIN_ENUM_MIN(evaluator<VectorX>::Alignment, evaluator<VectorY>::Alignment),
      |                                              ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:299:40:   required from 'void Eigen::MatrixBase<Derived>::applyOnTheLeft(Eigen::Index, Eigen::Index, const Eigen::JacobiRotation<OtherScalar>&) [with OtherScalar = double; Derived = Eigen::Matrix<double, -1, -1>; Eigen::Index = long long int]'
  299 |   internal::apply_rotation_in_the_plane(x, y, j);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:733:40:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  733 |             m_workMatrix.applyOnTheLeft(p,q,j_left);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:475:5:   required from 'void Eigen::internal::apply_rotation_in_the_plane(Eigen::DenseBase<Derived>&, Eigen::DenseBase<Derived>&, const Eigen::JacobiRotation<OtherScalar>&) [with VectorX = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>; VectorY = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>; OtherScalar = double]'
  475 |     EIGEN_PLAIN_ENUM_MIN(evaluator<VectorX>::Alignment, evaluator<VectorY>::Alignment),
      |                                              ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:315:40:   required from 'void Eigen::MatrixBase<Derived>::applyOnTheRight(Eigen::Index, Eigen::Index, const Eigen::JacobiRotation<OtherScalar>&) [with OtherScalar = double; Derived = Eigen::Matrix<double, -1, -1>; Eigen::Index = long long int]'
  315 |   internal::apply_rotation_in_the_plane(x, y, j.transpose());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:734:53:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  734 |             if(computeU()) m_matrixU.applyOnTheRight(p,q,j_left.transpose());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 1, -1>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:521:73:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  521 |     RealScalar biggest_col_sq_norm = numext::abs2(m_colNormsUpdated.tail(cols-k).maxCoeff(&biggest_col_index));
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:165:63:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  165 |     Map<typename internal::plain_col_type<PlainObject>::type> tmp(workspace,rows());
      |                                                               ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:166:82:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  166 |     Block<Derived, Derived::RowsAtCompileTime, EssentialPart::SizeAtCompileTime> right(derived(), 0, 1, rows(), cols()-1);
      |                                                                                  ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:27:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |                     ~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:168:21:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  168 |     tmp += this->col(0);
      |            ~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:169:25:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  169 |     this->col(0) -= tau * tmp;
      |                     ~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:169:25:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  169 |     this->col(0) -= tau * tmp;
      |                     ~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:53:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  170 |     right.noalias() -= tau * tmp * essential.adjoint();
      |                                    ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<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>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<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>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<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>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<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>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 0, 5>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<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>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<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>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:34:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  170 |     right.noalias() -= tau * tmp * essential.adjoint();
      |                        ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:127:63:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  127 |     Map<typename internal::plain_row_type<PlainObject>::type> tmp(workspace,cols());
      |                                                               ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:41:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |                     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:130:21:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  130 |     tmp += this->row(0);
      |            ~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:131:25:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  131 |     this->row(0) -= tau * tmp;
      |                     ~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:131:25:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  131 |     this->row(0) -= tau * tmp;
      |                     ~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:132:29:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  132 |     bottom.noalias() -= tau * essential * tmp;
      |                         ~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<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::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<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::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<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::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<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::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0, 5>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<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::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<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::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:132:41:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  132 |     bottom.noalias() -= tau * essential * tmp;
      |                         ~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:90:75:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   90 |   Matrix<typename MatrixType::Scalar, TFactorSize, TFactorSize, RowMajor> T(nbVecs,nbVecs);
      |                                                                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:175:44:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:93:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                                    ~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 0, 8>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:96:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                                    ~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1>, 0, 8>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:101:66:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  101 |   if(forward) tmp = T.template triangularView<Upper>()           * tmp;
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:175:44:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:102:63:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  102 |   else        tmp = T.template triangularView<Upper>().adjoint() * tmp;
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1>, 0, 8>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:102:66:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  102 |   else        tmp = T.template triangularView<Upper>().adjoint() * tmp;
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, 0, 8>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:22:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |                    ~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, -1, -1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, -1, -1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, -1, -1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, -1, -1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:846:33:   required from 'static Derived& Eigen::internal::setIdentity_impl<Derived, Big>::run(Derived&) [with Derived = Eigen::Matrix<double, -1, -1>; bool Big = false]'
  846 |     return m = Derived::Identity(m.rows(), m.cols());
      |                ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:875:50:   required from 'Derived& Eigen::MatrixBase<Derived>::setIdentity() [with Derived = Eigen::Matrix<double, -1, -1>]'
  875 |   return internal::setIdentity_impl<Derived>::run(derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:892:21:   required from 'Derived& Eigen::MatrixBase<Derived>::setIdentity(Eigen::Index, Eigen::Index) [with Derived = Eigen::Matrix<double, -1, -1>; Eigen::Index = long long int]'
  892 |   return setIdentity();
      |          ~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:698:45:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  698 |     if(m_computeFullU) m_matrixU.setIdentity(m_rows,m_rows);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:475:5:   required from 'void Eigen::internal::apply_rotation_in_the_plane(Eigen::DenseBase<Derived>&, Eigen::DenseBase<Derived>&, const Eigen::JacobiRotation<OtherScalar>&) [with VectorX = Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>; VectorY = Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>; OtherScalar = double]'
  475 |     EIGEN_PLAIN_ENUM_MIN(evaluator<VectorX>::Alignment, evaluator<VectorY>::Alignment),
      |                                              ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:299:40:   required from 'void Eigen::MatrixBase<Derived>::applyOnTheLeft(Eigen::Index, Eigen::Index, const Eigen::JacobiRotation<OtherScalar>&) [with OtherScalar = double; Derived = Eigen::Matrix<double, 2, 2>; Eigen::Index = long long int]'
  299 |   internal::apply_rotation_in_the_plane(x, y, j);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/misc/RealSvd2x2.h:46:19:   required from 'void Eigen::internal::real_2x2_jacobi_svd(const MatrixType&, Index, Index, Eigen::JacobiRotation<RealScalar>*, Eigen::JacobiRotation<RealScalar>*) [with MatrixType = Eigen::Matrix<double, -1, -1>; RealScalar = double; Index = long long int]'
   46 |   m.applyOnTheLeft(0,1,rot1);
      |   ~~~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:730:42:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  730 |             internal::real_2x2_jacobi_svd(m_workMatrix, p, q, &j_left, &j_right);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:79:51:   required from 'class Eigen::internal::visitor_evaluator<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false> >'
   79 |     CoeffReadCost = internal::evaluator<XprType>::CoeffReadCost
      |                                                   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>; Derived = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>]'
  123 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:374:14:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff(IndexType*) const [with int NaNPropagation = 0; IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  374 |   this->visit(maxVisitor);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:501:37:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff(IndexType*) const [with IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  501 |       return maxCoeff<PropagateFast>(index);
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:777:88:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  777 |     RealScalar maxRemainingSingularValue = m_singularValues.tail(m_diagSize-i).maxCoeff(&pos);
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >; Func = Eigen::internal::scalar_max_op<double, double, 0>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_max_op<double, double, 0>; Derived = Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:448:25:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff() const [with int NaNPropagation = 0; Derived = Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >; typename Eigen::internal::traits<T>::Scalar = double]'
  448 |   return derived().redux(Eigen::internal::scalar_max_op<Scalar,Scalar, NaNPropagation>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:466:37:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff() const [with Derived = Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >; typename Eigen::internal::traits<T>::Scalar = double]'
  466 |       return maxCoeff<PropagateFast>();
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:60:61:   required from here
   60 |     return jacobiSvd.singularValues().array().abs().maxCoeff() /
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1> >; Func = Eigen::internal::scalar_max_op<double, double, 1>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_max_op<double, double, 1>; Derived = Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:448:25:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff() const [with int NaNPropagation = 1; Derived = Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  448 |   return derived().redux(Eigen::internal::scalar_max_op<Scalar,Scalar, NaNPropagation>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:679:71:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  679 |   RealScalar scale = matrix.cwiseAbs().template maxCoeff<PropagateNaN>();
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:540:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  540 |     m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:132:29:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  132 |     bottom.noalias() -= tau * essential * tmp;
      |                         ~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0, 5>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:406:42:   required from 'Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::TriangularViewType& Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::setConstant(const Scalar&) [with _MatrixType = Eigen::Matrix<double, -1, -1>; unsigned int _Mode = 10; TriangularViewType = Eigen::TriangularView<Eigen::Matrix<double, -1, -1>, 10>; Scalar = double]'
  406 |     { return *this = MatrixType::Constant(derived().rows(), derived().cols(), value); }
      |                      ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:409:44:   required from 'Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::TriangularViewType& Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::setZero() [with _MatrixType = Eigen::Matrix<double, -1, -1>; unsigned int _Mode = 10; TriangularViewType = Eigen::TriangularView<Eigen::Matrix<double, -1, -1>, 10>]'
  409 |     TriangularViewType& setZero() { return setConstant(Scalar(0)); }
      |                                            ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:298:61:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  298 |         dst.template triangularView<StrictlyUpper>().setZero();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:63:57:   required from 'void Eigen::internal::make_block_householder_triangular_factor(TriangularFactorType&, const VectorsType&, const CoeffsType&) [with TriangularFactorType = Eigen::Matrix<double, -1, -1, 1, -1, -1>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   63 |       triFactor.row(i).tail(rt).noalias() = -hCoeffs(i) * vectors.col(i).tail(rs).adjoint()
      |                                             ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 5>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 5>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 5>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 5>, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 5>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:73:50:   required from 'void Eigen::internal::make_block_householder_triangular_factor(TriangularFactorType&, const VectorsType&, const CoeffsType&) [with TriangularFactorType = Eigen::Matrix<double, -1, -1, 1, -1, -1>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   73 |           triFactor.row(i).tail(nbVecs-j-1) += z * triFactor.row(j).tail(nbVecs-j-1);
      |                                                ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 9>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 3, 3> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 3, 3>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:146:17:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  146 |     EigenMatrix m = construct_covariance_matrix(cov);
      |                 ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 3, 3> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 3, 3> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 3>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 3, 1> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 3, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:149:17:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  149 |     EigenVector eigenvalues_;
      |                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 3, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 3, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 2, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 2, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 2, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:507:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  507 |     m_colNormsDirect.coeffRef(k) = m_qr.col(k).norm();
      |                                    ~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:540:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  540 |     m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:93:22:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:540:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  540 |     m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_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
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:567:77:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  567 |           m_colNormsDirect.coeffRef(j) = m_qr.col(j).tail(rows - k - 1).norm();
      |                                          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, -1, -1>, -1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:73:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                                                                         ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/SVDBase.h:315:54:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:73:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                                                                         ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, Eigen::Matrix<double, -1, 1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, Eigen::Matrix<double, -1, 1>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, Eigen::Matrix<double, -1, 1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, Eigen::Matrix<double, -1, 1>, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, Eigen::Matrix<double, -1, 1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, Eigen::Matrix<double, -1, 1>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/SVDBase.h:315:57:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:73:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                                                                         ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DiagonalMatrix.h:278:47:   required from 'struct Eigen::internal::traits<Eigen::DiagonalWrapper<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> > > >'
  278 |   typedef typename DiagonalVectorType::Scalar Scalar;
      |                                               ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/EigenBase.h:42:59:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:73:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                                                                         ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::DiagonalWrapper<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> > >, Eigen::Matrix<double, -1, 1>, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::DiagonalWrapper<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> > >, Eigen::Matrix<double, -1, 1>, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::DiagonalWrapper<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> > >, Eigen::Matrix<double, -1, 1>, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::DiagonalWrapper<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> > >, Eigen::Matrix<double, -1, 1>, 1, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::DiagonalWrapper<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> > >, Eigen::Matrix<double, -1, 1>, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::DiagonalWrapper<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> > >, Eigen::Matrix<double, -1, 1>, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/SVDBase.h:316:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:73:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                                                                         ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, Eigen::Matrix<double, -1, 1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, Eigen::Matrix<double, -1, 1>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, Eigen::Matrix<double, -1, 1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, Eigen::Matrix<double, -1, 1>, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, Eigen::Matrix<double, -1, 1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, Eigen::Matrix<double, -1, 1>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/SVDBase.h:317:36:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:73:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                                                                         ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:92:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 3, 3> >'
   92 |             >::type DiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:97:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 3, 3> >'
   97 |             >::type SubDiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, 0>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:92:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 2, 2> >'
   92 |             >::type DiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:97:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 2, 2> >'
   97 |             >::type SubDiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:97:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 2, 2> >'
   97 |             >::type SubDiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   required from 'class Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 2, 2> >'
  111 |     typedef typename TridiagonalizationType::SubDiagonalType SubDiagonalType;
      |                                                              ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:97:48:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, 1, 0, 1, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 1, -1>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:79:51:   required from 'class Eigen::internal::visitor_evaluator<Eigen::Block<Eigen::Matrix<double, 1, -1>, 1, -1, false> >'
   79 |     CoeffReadCost = internal::evaluator<XprType>::CoeffReadCost
      |                                                   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 1, -1>, 1, -1, false>, 0>; Derived = Eigen::Block<Eigen::Matrix<double, 1, -1>, 1, -1, false>]'
  123 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:374:14:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff(IndexType*) const [with int NaNPropagation = 0; IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 1, -1>, 1, -1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  374 |   this->visit(maxVisitor);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:501:37:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff(IndexType*) const [with IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 1, -1>, 1, -1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  501 |       return maxCoeff<PropagateFast>(index);
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:521:90:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  521 |     RealScalar biggest_col_sq_norm = numext::abs2(m_colNormsUpdated.tail(cols-k).maxCoeff(&biggest_col_index));
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:78:71:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:540:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  540 |     m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:142:7:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::coeff(Eigen::Index) const [with Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>; CoeffReturnType = const double&; Eigen::Index = long long int]'
  142 |       EIGEN_STATIC_ASSERT(internal::evaluator<Derived>::Flags & LinearAccessBit,
      |                                                         ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:79:20:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholder(EssentialPart&, Scalar&, RealScalar&) const [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   79 |   Scalar c0 = coeff(0);
      |               ~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:46:18:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholderInPlace(Scalar&, RealScalar&) [with Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   46 |   makeHouseholder(essentialPart, tau, beta);
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:540:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  540 |     m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Dense>'
  372 |   typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type;
      |                                                                                                      ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:369:45:   required from 'struct Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>'
  369 |   typedef typename nested_eval<Lhs,1>::type LhsNested;
      |                                             ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::Product<Lhs, Rhs, Options>, Eigen::internal::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::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; int Options = 0; Scalar = double; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>]'
  148 |     generic_product_impl<Lhs, Rhs>::evalTo(dst, src.lhs(), src.rhs());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Dense>'
  372 |   typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type;
      |                                                                                                      ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:369:45:   required from 'struct Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>'
  369 |   typedef typename nested_eval<Lhs,1>::type LhsNested;
      |                                             ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::Product<Lhs, Rhs, Options>, Eigen::internal::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::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; int Options = 0; Scalar = double; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>]'
  148 |     generic_product_impl<Lhs, Rhs>::evalTo(dst, src.lhs(), src.rhs());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/NoAlias.h:43:31:   required from 'ExpressionType& Eigen::NoAlias<ExpressionType, StorageBase>::operator=(const StorageBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>; ExpressionType = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; StorageBase = Eigen::MatrixBase]'
   43 |       call_assignment_no_alias(m_expression, other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Block<const 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;
      |                                                                                                      ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:370:45:   required from 'struct Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>'
  370 |   typedef typename nested_eval<Rhs,1>::type RhsNested;
      |                                             ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::Product<Lhs, Rhs, Options>, Eigen::internal::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::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; int Options = 0; Scalar = double; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>]'
  148 |     generic_product_impl<Lhs, Rhs>::evalTo(dst, src.lhs(), src.rhs());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/NoAlias.h:43:31:   required from 'ExpressionType& Eigen::NoAlias<ExpressionType, StorageBase>::operator=(const StorageBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>; ExpressionType = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; StorageBase = Eigen::MatrixBase]'
   43 |       call_assignment_no_alias(m_expression, other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:142:7:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::coeff(Eigen::Index) const [with Derived = Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  142 |       EIGEN_STATIC_ASSERT(internal::evaluator<Derived>::Flags & LinearAccessBit,
      |                                                         ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:182:19:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::operator()(Eigen::Index) const [with Derived = Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  182 |       return coeff(index);
      |              ~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:63:53:   required from 'void Eigen::internal::make_block_householder_triangular_factor(TriangularFactorType&, const VectorsType&, const CoeffsType&) [with TriangularFactorType = Eigen::Matrix<double, -1, -1, 1, -1, -1>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   63 |       triFactor.row(i).tail(rt).noalias() = -hCoeffs(i) * vectors.col(i).tail(rs).adjoint()
      |                                              ~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 3, 3>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 3, 3> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:453:34:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&, int) [with InputType = Eigen::Matrix<double, 3, 3>; _MatrixType = Eigen::Matrix<double, 3, 3>]'
  453 |   RealScalar scale = mat.cwiseAbs().maxCoeff();
      |                      ~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:104:26:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 2, 2>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 2, 2> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:453:34:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&, int) [with InputType = Eigen::Matrix<double, 2, 2>; _MatrixType = Eigen::Matrix<double, 2, 2>]'
  453 |   RealScalar scale = mat.cwiseAbs().maxCoeff();
      |                      ~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:104:26:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/assert.hpp:35,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:31,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:20:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >; Value = float; ID = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Params = boost::bgl_named_params<_project2nd<float, float>, boost::distance_combine_t, boost::bgl_named_params<std::less<float>, boost::distance_compare_t, boost::bgl_named_params<long long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> > > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/int.hpp:20,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda_fwd.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_spec.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/or.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/type_traits.h:16,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Algebraic_structure_traits.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/number_type_basic.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:28:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function 'boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >::~RandomAccessIteratorConcept()'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro 'BOOST_concept'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; SourceIterator = long long unsigned int*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function 'boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >::~IncidenceGraphConcept()'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro 'BOOST_concept'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >, CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; SourceIterator = long long unsigned int*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:42:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function 'void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; Graph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>]'
   37 |     void constraints()
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; SourceIterator = long long unsigned int*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41:   required from 'struct Eigen::internal::binary_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   required from 'struct Eigen::internal::evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>; SrcXprType = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >; Functor = assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>; SrcXprType = Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, -1>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >; Derived = Eigen::Matrix<double, -1, -1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:697:18:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  697 |     m_workMatrix = matrix.block(0,0,m_diagSize,m_diagSize) / scale;
      |     ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:670:23:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:670:31:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Ref.h:44:50:   required from 'struct Eigen::internal::traits<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >::match<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   44 |       DerivedAlignment = int(evaluator<Derived>::Alignment),
      |                                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Ref.h:288:101:   required by substitution of 'template<class Derived> Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >::Ref(const Eigen::DenseBase<Derived>&, typename Eigen::internal::enable_if<(bool)(Eigen::internal::traits<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >::match<Derived>::MatchAtCompileTime), Derived>::type*) [with Derived = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>]'
  288 |                                  typename internal::enable_if<bool(Traits::template match<Derived>::MatchAtCompileTime),Derived>::type* = 0);
      |                                                                                                     ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:704:25:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  704 |           extract_kernel(tmp, eivecs.col(k), eivecs.col(l));
      |           ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::computeDirect(const MatrixType&, int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; MatrixType = Eigen::Matrix<double, 3, 3>]'
  830 |   internal::direct_selfadjoint_eigenvalues<SelfAdjointEigenSolver,Size,NumTraits<Scalar>::IsComplex>::run(*this,matrix,options);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:101:32:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:712:60:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  712 |           eivecs.col(l) -= eivecs.col(k).dot(eivecs.col(l))*eivecs.col(l);
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:731:17:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28:   required from 'struct Eigen::internal::traits<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:398:143:   required from 'Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::TriangularViewType& Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::operator/=(const typename Eigen::internal::traits<T>::Scalar&) [with _MatrixType = Eigen::Matrix<double, 3, 3>; unsigned int _Mode = 1; TriangularViewType = Eigen::TriangularView<Eigen::Matrix<double, 3, 3>, 1>; typename Eigen::internal::traits<T>::Scalar = double]'
  398 |     TriangularViewType&  operator/=(const typename internal::traits<MatrixType>::Scalar& other) { return *this = derived().nestedExpression() / other; }
      |                                                                                                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:455:40:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:20:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator*=(const Scalar&) [with Derived = Eigen::Matrix<double, 3, 1>; Scalar = double]'
   20 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:463:14:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&, int) [with InputType = Eigen::Matrix<double, 3, 3>; _MatrixType = Eigen::Matrix<double, 3, 3>]'
  463 |   m_eivalues *= scale;
      |   ~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:104:26:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:777:23:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:777:31:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 2, 1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 2, 1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 2, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<Eigen::Matrix<double, 2, 1> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:815:17:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28:   required from 'struct Eigen::internal::traits<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:398:143:   required from 'Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::TriangularViewType& Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::operator/=(const typename Eigen::internal::traits<T>::Scalar&) [with _MatrixType = Eigen::Matrix<double, 2, 2>; unsigned int _Mode = 1; TriangularViewType = Eigen::TriangularView<Eigen::Matrix<double, 2, 2>, 1>; typename Eigen::internal::traits<T>::Scalar = double]'
  398 |     TriangularViewType&  operator/=(const typename internal::traits<MatrixType>::Scalar& other) { return *this = derived().nestedExpression() / other; }
      |                                                                                                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:455:40:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 2, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:20:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator*=(const Scalar&) [with Derived = Eigen::Matrix<double, 2, 1>; Scalar = double]'
   20 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:463:14:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&, int) [with InputType = Eigen::Matrix<double, 2, 2>; _MatrixType = Eigen::Matrix<double, 2, 2>]'
  463 |   m_eivalues *= scale;
      |   ~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:104:26:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::Graph<G>::~Graph() [with G = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:165:3:   required from 'struct boost::CopyConstructibleConcept<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >'
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:39:9:   required from 'void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; Graph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >, CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >, CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >, CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >, CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:65:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function 'boost::CopyConstructibleConcept<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >::~CopyConstructibleConcept()'
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro 'BOOST_concept'
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:208:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase<Derived>&) [with Derived = Eigen::Matrix<double, 1, -1>; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 1, -1>; Func = Eigen::internal::scalar_max_op<double, double, 0>; Evaluator = Eigen::internal::redux_evaluator<Eigen::Matrix<double, 1, -1> >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_max_op<double, double, 0>; Derived = Eigen::Matrix<double, 1, -1>; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:448:25:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff() const [with int NaNPropagation = 0; Derived = Eigen::Matrix<double, 1, -1>; typename Eigen::internal::traits<T>::Scalar = double]'
  448 |   return derived().redux(Eigen::internal::scalar_max_op<Scalar,Scalar, NaNPropagation>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:466:37:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff() const [with Derived = Eigen::Matrix<double, 1, -1>; typename Eigen::internal::traits<T>::Scalar = double]'
  466 |       return maxCoeff<PropagateFast>();
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:511:85:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  511 |   RealScalar threshold_helper =  numext::abs2<RealScalar>(m_colNormsUpdated.maxCoeff() * NumTraits<RealScalar>::epsilon()) / RealScalar(rows);
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:564:45:   required from 'struct Eigen::internal::unary_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  564 |     CoeffReadCost = int(evaluator<ArgType>::CoeffReadCost) + int(functor_traits<UnaryOp>::Cost),
      |                                             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:540:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  540 |     m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>; Functor = add_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>; Functor = Eigen::internal::add_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>; Func = add_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>; Func = add_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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:177:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator+=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>; Derived = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >]'
  177 |   call_assignment(derived(), other.derived(), internal::add_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:168:9:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  168 |     tmp += this->col(0);
      |     ~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:21:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  170 |     right.noalias() -= tau * tmp * essential.adjoint();
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:21:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  170 |     right.noalias() -= tau * tmp * essential.adjoint();
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 16, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>, 16, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 16, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 16, Eigen::Stride<0, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 16, Eigen::Stride<0, 0> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Lhs = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > >; Rhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >; Func = generic_product_impl<Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::DenseShape, Eigen::DenseShape, 5>::sub]'
  280 |     func(dst.col(j), rhsEval.coeff(Index(0),j) * actual_lhs);
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:329:41:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:21:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  170 |     right.noalias() -= tau * tmp * essential.adjoint();
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false>; Functor = add_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false>; Functor = Eigen::internal::add_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false>; Func = add_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false>; Func = add_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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:177:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator+=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false>; Derived = Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >]'
  177 |   call_assignment(derived(), other.derived(), internal::add_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:130:9:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  130 |     tmp += this->row(0);
      |     ~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, Eigen::Dense>'
  372 |   typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type;
      |                                                                                                      ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:369:45:   required from 'struct Eigen::internal::generic_product_impl<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, Eigen::Matrix<double, -1, 1>, Eigen::DenseShape, Eigen::DenseShape, 7>'
  369 |   typedef typename nested_eval<Lhs,1>::type LhsNested;
      |                                             ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:73:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                                                                         ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 3, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 3, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 3, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Array<double, 3, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::Array<double, 3, 1> >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Array<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Array.h:45:7:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:34:67:   required from 'Derived& Eigen::ArrayBase<Derived>::operator-=(const Scalar&) [with Derived = Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >; Scalar = double]'
   34 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::sub_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:670:34:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  670 |     scaledMat.diagonal().array() -= shift;
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:41:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator/=(const Scalar&) [with Derived = Eigen::Matrix<double, 3, 3>; Scalar = double]'
   41 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::div_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:672:29:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  672 |     if(scale > 0) scaledMat /= scale;   // TODO for scale==0 we could save the remaining operations
      |                   ~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:640:28:   required from 'static bool Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::extract_kernel(MatrixType&, Eigen::Ref<typename SolverType::RealVectorType>, Eigen::Ref<typename SolverType::RealVectorType>) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>; typename SolverType::RealVectorType = Eigen::Matrix<double, 3, 1>; typename Eigen::internal::conditional<typename SolverType::RealVectorType::IsVectorAtCompileTime, Eigen::InnerStride<1>, Eigen::OuterStride<> >::type = Eigen::InnerStride<1>]'
  640 |     mat.diagonal().cwiseAbs().maxCoeff(&i0);
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:704:25:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:648:23:   required from 'static bool Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::extract_kernel(MatrixType&, Eigen::Ref<typename SolverType::RealVectorType>, Eigen::Ref<typename SolverType::RealVectorType>) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>; typename SolverType::RealVectorType = Eigen::Matrix<double, 3, 1>; typename Eigen::internal::conditional<typename SolverType::RealVectorType::IsVectorAtCompileTime, Eigen::InnerStride<1>, Eigen::OuterStride<> >::type = Eigen::InnerStride<1>]'
  648 |     if(n0>n1) res = c0/sqrt(n0);
      |                     ~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:704:25:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 2, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 2, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 2, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Array<double, 2, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::Array<double, 2, 1> >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Array<double, 2, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Array.h:45:7:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, 2, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:34:67:   required from 'Derived& Eigen::ArrayBase<Derived>::operator-=(const Scalar&) [with Derived = Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >; Scalar = double]'
   34 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::sub_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:777:34:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 2, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 2, 2> >; MatrixType = Eigen::Matrix<double, 2, 2>]'
  777 |     scaledMat.diagonal().array() -= shift;
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 2, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:41:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator/=(const Scalar&) [with Derived = Eigen::Matrix<double, 2, 2>; Scalar = double]'
   41 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::div_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:780:17:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 2, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 2, 2> >; MatrixType = Eigen::Matrix<double, 2, 2>]'
  780 |       scaledMat /= scale;
      |       ~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, -1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, -1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, -1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, -1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, -1>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:451:40:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:603:11:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:603:11:   required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >; Value = float; ID = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Params = boost::bgl_named_params<_project2nd<float, float>, boost::distance_combine_t, boost::bgl_named_params<std::less<float>, boost::distance_compare_t, boost::bgl_named_params<long long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> > > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; SourceIterator = long long unsigned int*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; SourceIterator = long long unsigned int*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; SourceIterator = long long unsigned int*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; SourceIterator = long long unsigned int*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; SourceIterator = long long unsigned int*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:165:3:   required from 'struct boost::CopyConstructibleConcept<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >'
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:148:7:   required from 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:180:7:   required from 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<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());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<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>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:46:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:110:23:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::norm() const [with Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
  110 |   return numext::sqrt(squaredNorm());
      |                       ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:507:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  507 |     m_colNormsDirect.coeffRef(k) = m_qr.col(k).norm();
      |                                    ~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_abs2_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_abs2_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);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_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());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_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>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:46:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [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]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:110:23:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::norm() const [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]'
  110 |   return numext::sqrt(squaredNorm());
      |                       ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:567:77:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  567 |           m_colNormsDirect.coeffRef(j) = m_qr.col(j).tail(rows - k - 1).norm();
      |                                          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:16:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false> >'
 1043 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; 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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; Functor = add_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; 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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; Functor = add_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; 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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; Functor = Eigen::internal::add_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:846:33:   required from 'static Derived& Eigen::internal::setIdentity_impl<Derived, Big>::run(Derived&) [with Derived = Eigen::Matrix<double, 3, 3>; bool Big = false]'
  846 |     return m = Derived::Identity(m.rows(), m.cols());
      |                ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:875:50:   required from 'Derived& Eigen::MatrixBase<Derived>::setIdentity() [with Derived = Eigen::Matrix<double, 3, 3>]'
  875 |   return internal::setIdentity_impl<Derived>::run(derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:683:27:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Matrix<double, 3, 1>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:646:68:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:44:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>; U = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:147:18:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 2, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:846:33:   required from 'static Derived& Eigen::internal::setIdentity_impl<Derived, Big>::run(Derived&) [with Derived = Eigen::Matrix<double, 2, 2>; bool Big = false]'
  846 |     return m = Derived::Identity(m.rows(), m.cols());
      |                ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:875:50:   required from 'Derived& Eigen::MatrixBase<Derived>::setIdentity() [with Derived = Eigen::Matrix<double, 2, 2>]'
  875 |   return internal::setIdentity_impl<Derived>::run(derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:790:27:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:370:46:   required from 'void Eigen::internal::tridiagonalization_inplace(MatrixType&, CoeffVectorType&) [with MatrixType = Eigen::Matrix<double, 2, 2>; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  370 |                                   * (conj(h) * matA.col(i).tail(remainingSize)));
      |                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:449:31:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, -1, 1, 0, 2, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, -1, 1, 0, 2, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 1, 0, 2, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:370:35:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long long int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:514:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:109:22: note: in a call to non-static member function 'boost::SignedInteger<long long int>::~SignedInteger()'
  109 |   template <> struct SignedInteger< ::boost::long_long_type> {};
      |                      ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:545:11:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:545:11:   required from 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:573:11:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:573:11:   required from 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:46:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:78:71:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:540:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  540 |     m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:333:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of 'class Eigen::internal::gemv_traits<double, double, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:87:38:   required from 'struct Eigen::internal::general_matrix_vector_product<long long int, double, Eigen::internal::const_blas_data_mapper<double, long long int, 0>, 0, false, double, Eigen::internal::const_blas_data_mapper<double, long long int, 1>, false, 0>'
   87 |   typedef typename Traits::LhsPacket LhsPacket;
      |                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:253:134:   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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Dest = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; typename Dest::Scalar = double]'
  252 |       general_matrix_vector_product
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                   
  253 |           <Index,LhsScalar,LhsMapper,ColMajor,LhsBlasTraits::NeedToConjugate,RhsScalar,RhsMapper,RhsBlasTraits::NeedToConjugate>::run(
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  254 |           actualLhs.rows(), actualLhs.cols(),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                         
  255 |           LhsMapper(actualLhs.data(), actualLhs.outerStride()),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                       
  256 |           RhsMapper(actualRhs.data(), actualRhs.innerStride()),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                       
  257 |           dest.data(), 1,
      |           ~~~~~~~~~~~~~~~                                                                                                             
  258 |           compatibleAlpha);
      |           ~~~~~~~~~~~~~~~~                                                                                                            
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::DenseShape, 7>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Scalar = double]'
  385 |     internal::gemv_dense_selector<Side,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                             (int(MatrixType::Flags)&RowMajorBit) ? RowMajor : ColMajor,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |                             bool(internal::blas_traits<MatrixType>::HasUsableDirectAccess)
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  388 |                            >::run(actual_lhs, actual_rhs, dst, alpha);
      |                            ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:33:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>]'
  349 |   { dst.setZero(); scaleAndAddTo(dst, lhs, rhs, Scalar(1)); }
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                                     ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                      ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                          ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                                                                  ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of 'class Eigen::internal::gemv_traits<double, double, 1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:91:42:   required from 'struct Eigen::internal::general_matrix_vector_product<long long int, double, Eigen::internal::const_blas_data_mapper<double, long long int, 0>, 0, false, double, Eigen::internal::const_blas_data_mapper<double, long long int, 1>, false, 0>'
   91 |   typedef typename HalfTraits::LhsPacket LhsPacketHalf;
      |                                          ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:253:134:   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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Dest = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; typename Dest::Scalar = double]'
  252 |       general_matrix_vector_product
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                   
  253 |           <Index,LhsScalar,LhsMapper,ColMajor,LhsBlasTraits::NeedToConjugate,RhsScalar,RhsMapper,RhsBlasTraits::NeedToConjugate>::run(
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  254 |           actualLhs.rows(), actualLhs.cols(),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                         
  255 |           LhsMapper(actualLhs.data(), actualLhs.outerStride()),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                       
  256 |           RhsMapper(actualRhs.data(), actualRhs.innerStride()),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                       
  257 |           dest.data(), 1,
      |           ~~~~~~~~~~~~~~~                                                                                                             
  258 |           compatibleAlpha);
      |           ~~~~~~~~~~~~~~~~                                                                                                            
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::DenseShape, 7>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Scalar = double]'
  385 |     internal::gemv_dense_selector<Side,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                             (int(MatrixType::Flags)&RowMajorBit) ? RowMajor : ColMajor,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |                             bool(internal::blas_traits<MatrixType>::HasUsableDirectAccess)
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  388 |                            >::run(actual_lhs, actual_rhs, dst, alpha);
      |                            ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:33:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>]'
  349 |   { dst.setZero(); scaleAndAddTo(dst, lhs, rhs, Scalar(1)); }
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                                     ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                      ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                          ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                                                                  ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of 'class Eigen::internal::gemv_traits<double, double, 2>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:95:45:   required from 'struct Eigen::internal::general_matrix_vector_product<long long int, double, Eigen::internal::const_blas_data_mapper<double, long long int, 0>, 0, false, double, Eigen::internal::const_blas_data_mapper<double, long long int, 1>, false, 0>'
   95 |   typedef typename QuarterTraits::LhsPacket LhsPacketQuarter;
      |                                             ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:253:134:   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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Dest = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; typename Dest::Scalar = double]'
  252 |       general_matrix_vector_product
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                   
  253 |           <Index,LhsScalar,LhsMapper,ColMajor,LhsBlasTraits::NeedToConjugate,RhsScalar,RhsMapper,RhsBlasTraits::NeedToConjugate>::run(
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  254 |           actualLhs.rows(), actualLhs.cols(),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                         
  255 |           LhsMapper(actualLhs.data(), actualLhs.outerStride()),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                       
  256 |           RhsMapper(actualRhs.data(), actualRhs.innerStride()),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                       
  257 |           dest.data(), 1,
      |           ~~~~~~~~~~~~~~~                                                                                                             
  258 |           compatibleAlpha);
      |           ~~~~~~~~~~~~~~~~                                                                                                            
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::DenseShape, 7>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Scalar = double]'
  385 |     internal::gemv_dense_selector<Side,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                             (int(MatrixType::Flags)&RowMajorBit) ? RowMajor : ColMajor,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |                             bool(internal::blas_traits<MatrixType>::HasUsableDirectAccess)
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  388 |                            >::run(actual_lhs, actual_rhs, dst, alpha);
      |                            ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:33:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>]'
  349 |   { dst.setZero(); scaleAndAddTo(dst, lhs, rhs, Scalar(1)); }
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                                     ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                      ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                          ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                                                                  ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Dest = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; typename Dest::Scalar = double]'
  296 |           dest.matrix() += actualAlpha * MappedDest(actualDestPtr, dest.size());
      |                            ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:207:26:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> > >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> > >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:207:43:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:330:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of 'class Eigen::internal::gebp_traits<double, double, false, false, 1, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:92:29:   required from 'struct Eigen::internal::product_triangular_matrix_matrix<double, long long int, 5, true, 0, false, 0, false, 0, 1, 0>'
   92 |     SmallPanelWidth   = 2 * EIGEN_PLAIN_ENUM_MAX(Traits::mr,Traits::nr),
      |                                                          ^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; int ProductTag = 8; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::subTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>]'
  357 |   { scaleAndAddTo(dst, lhs, rhs, Scalar(-1)); }
      |     ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                                              ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  457 |         dst.topRows(diagSize) -= ((lhs_alpha-LhsScalar(1))*a_rhs).topRows(diagSize);
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const 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::Matrix<double, -1, -1> >, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const 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::Matrix<double, -1, -1> >, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const 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::Matrix<double, -1, -1> >, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const 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::Matrix<double, -1, -1> >, -1, -1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const 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::Matrix<double, -1, -1> >, -1, -1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const 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::Matrix<double, -1, -1> >, -1, -1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:74:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  462 |         dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:475:5:   required from 'void Eigen::internal::apply_rotation_in_the_plane(Eigen::DenseBase<Derived>&, Eigen::DenseBase<Derived>&, const Eigen::JacobiRotation<OtherScalar>&) [with VectorX = Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>; VectorY = Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>; OtherScalar = double]'
  475 |     EIGEN_PLAIN_ENUM_MIN(evaluator<VectorX>::Alignment, evaluator<VectorY>::Alignment),
      |                                              ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:315:40:   required from 'void Eigen::MatrixBase<Derived>::applyOnTheRight(Eigen::Index, Eigen::Index, const Eigen::JacobiRotation<OtherScalar>&) [with OtherScalar = double; Derived = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >; Eigen::Index = long long int]'
  315 |   internal::apply_rotation_in_the_plane(x, y, j.transpose());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:895:24:   required from 'void Eigen::internal::tridiagonal_qr_step(RealScalar*, RealScalar*, Index, Index, Scalar*, Index) [with int StorageOrder = 0; RealScalar = double; Scalar = double; Index = long long int]'
  895 |       q.applyOnTheRight(k,k+1,rot);
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:548:87:   required from 'Eigen::ComputationInfo Eigen::internal::computeFromTridiagonal_impl(DiagType&, SubDiagType&, Eigen::Index, bool, MatrixType&) [with MatrixType = Eigen::Matrix<double, 3, 3>; DiagType = Eigen::Matrix<double, 3, 1>; SubDiagType = Eigen::Matrix<double, 2, 1>; Eigen::Index = long long int]'
  548 |     internal::tridiagonal_qr_step<MatrixType::Flags&RowMajorBit ? RowMajor : ColMajor>(diag.data(), subdiag.data(), start, end, computeEigenvectors ? eivec.data() : (Scalar*)0, n);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:460:49:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&, int) [with InputType = Eigen::Matrix<double, 3, 3>; _MatrixType = Eigen::Matrix<double, 3, 3>]'
  460 |   m_info = internal::computeFromTridiagonal_impl(diag, m_subdiag, m_maxIterations, computeEigenvectors, m_eivec);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:104:26:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:79:51:   required from 'class Eigen::internal::visitor_evaluator<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >'
   79 |     CoeffReadCost = internal::evaluator<XprType>::CoeffReadCost
      |                                                   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:123:17:   required from 'void Eigen::DenseBase<Derived>::visit(Visitor&) const [with Visitor = Eigen::internal::min_coeff_visitor<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 0>; Derived = Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>]'
  123 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:323:14:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::minCoeff(IndexType*) const [with int NaNPropagation = 0; IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  323 |   this->visit(minVisitor);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:496:37:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::minCoeff(IndexType*) const [with IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  496 |       return minCoeff<PropagateFast>(index);
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:563:35:   required from 'Eigen::ComputationInfo Eigen::internal::computeFromTridiagonal_impl(DiagType&, SubDiagType&, Eigen::Index, bool, MatrixType&) [with MatrixType = Eigen::Matrix<double, 3, 3>; DiagType = Eigen::Matrix<double, 3, 1>; SubDiagType = Eigen::Matrix<double, 2, 1>; Eigen::Index = long long int]'
  563 |       diag.segment(i,n-i).minCoeff(&k);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:460:49:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  363 |     (covariance, eigen_values, eigen_vectors);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:14:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28:   required from 'struct Eigen::internal::traits<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:131:14:   required from 'const Eigen::MatrixBase<Derived>::PlainObject Eigen::MatrixBase<Derived>::normalized() const [with Derived = Eigen::Matrix<double, 2, 1>; PlainObject = Eigen::Matrix<double, 2, 1>]'
  131 |     return n / numext::sqrt(z);
      |            ~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/OrthoMethods.h:211:80:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:268:7:   required from 'Eigen::MapBase<Derived, 1>::ScalarWithConstIfNotLvalue& Eigen::MapBase<Derived, 1>::coeffRef(Eigen::Index) [with Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>; ScalarWithConstIfNotLvalue = double; Eigen::Index = long long int]'
   15 |       EIGEN_STATIC_ASSERT((int(internal::evaluator<Derived>::Flags) & LinearAccessBit) || Derived::IsVectorAtCompileTime, \
      |                                                              ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:367:25:   required from 'void Eigen::internal::tridiagonalization_inplace(MatrixType&, CoeffVectorType&) [with MatrixType = Eigen::Matrix<double, 2, 2>; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  367 |     matA.col(i).coeffRef(i+1) = 1;
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:449:31:   required from 'static void Eigen::internal::tridiagonalization_inplace_selector<MatrixType, Size, IsComplex>::run(MatrixType&, DiagonalType&, SubDiagonalType&, CoeffVectorType&, bool) [with DiagonalType = Eigen::Matrix<double, 2, 1>; SubDiagonalType = Eigen::Matrix<double, 1, 1, 0, 1, 1>; MatrixType = Eigen::Matrix<double, 2, 2>; int Size = 2; bool IsComplex = false; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  449 |     tridiagonalization_inplace(mat, hCoeffs);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:434:55:   required from 'void Eigen::internal::tridiagonalization_inplace(MatrixType&, DiagonalType&, SubDiagonalType&, CoeffVectorType&, bool) [with MatrixType = Eigen::Matrix<double, 2, 2>; DiagonalType = Eigen::Matrix<double, 2, 1>; SubDiagonalType = Eigen::Matrix<double, 1, 1, 0, 1, 1>; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  434 |   tridiagonalization_inplace_selector<MatrixType>::run(mat, diag, subdiag, hcoeffs, extractQ);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:458:39:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&, int) [with InputType = Eigen::Matrix<double, 2, 2>; _MatrixType = Eigen::Matrix<double, 2, 2>]'
  458 |   internal::tridiagonalization_inplace(mat, diag, m_subdiag, m_hcoeffs, computeEigenvectors);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:104:26:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:79:51:   required from 'class Eigen::internal::visitor_evaluator<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false> >'
   79 |     CoeffReadCost = internal::evaluator<XprType>::CoeffReadCost
      |                                                   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:123:17:   required from 'void Eigen::DenseBase<Derived>::visit(Visitor&) const [with Visitor = Eigen::internal::min_coeff_visitor<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>, 0>; Derived = Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>]'
  123 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:323:14:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::minCoeff(IndexType*) const [with int NaNPropagation = 0; IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  323 |   this->visit(minVisitor);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:496:37:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::minCoeff(IndexType*) const [with IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  496 |       return minCoeff<PropagateFast>(index);
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:563:35:   required from 'Eigen::ComputationInfo Eigen::internal::computeFromTridiagonal_impl(DiagType&, SubDiagType&, Eigen::Index, bool, MatrixType&) [with MatrixType = Eigen::Matrix<double, 2, 2>; DiagType = Eigen::Matrix<double, 2, 1>; SubDiagType = Eigen::Matrix<double, 1, 1, 0, 1, 1>; Eigen::Index = long long int]'
  563 |       diag.segment(i,n-i).minCoeff(&k);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:460:49:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:62:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>; SrcXprType = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > >; Functor = assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>; SrcXprType = Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > >; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Assign.h:66:28:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:540:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  540 |     m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:207:43:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:50:23:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false>; U = Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true>; ResScalar = double]'
   50 |     return a.transpose().template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:50:23:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true>; U = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>; ResScalar = double]'
   50 |     return a.transpose().template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > >, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > >, -1, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > >, -1, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > >, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > >, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > >, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:32:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:48:   required from 'static void Eigen::internal::triangular_product_impl<Mode, false, Lhs, true, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; int Mode = 5; Lhs = 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >; Rhs = const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; typename Dest::Scalar = double]'
  194 |             ::run(rhs.transpose(),lhs.transpose(), dstT, alpha);
      |                                   ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:783:113:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 64>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 8, 8, 0, 8, 8> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 8, 8, 0, 8, 8> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 8, 8, 0, 8, 8>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:150:68:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  150 |     Matrix<Scalar,SmallPanelWidth,SmallPanelWidth,LhsStorageOrder> triangularBuffer(a);
      |                                                                    ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 8, 8, 0, 8, 8> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 8, 8, 0, 8, 8> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 8, 8, 0, 8, 8> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:153:32:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 8>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:153:32:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  153 |       triangularBuffer.diagonal().setZero();
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of 'class Eigen::internal::gebp_traits<double, double, false, false, 1, 1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1080:42:   required from 'struct Eigen::internal::gebp_kernel<double, double, long long int, Eigen::internal::blas_data_mapper<double, long long int, 0, 0, 1>, 4, 4, false, false>'
 1080 |   typedef typename HalfTraits::LhsPacket LhsPacketHalf;
      |                                          ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:157:103:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  157 |     gebp_kernel<Scalar, Scalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp_kernel;
      |                                                                                                       ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; int ProductTag = 8; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                                              ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of 'class Eigen::internal::gebp_traits<double, double, false, false, 1, 2>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1085:45:   required from 'struct Eigen::internal::gebp_kernel<double, double, long long int, Eigen::internal::blas_data_mapper<double, long long int, 0, 0, 1>, 4, 4, false, false>'
 1085 |   typedef typename QuarterTraits::LhsPacket LhsPacketQuarter;
      |                                             ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:157:103:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  157 |     gebp_kernel<Scalar, Scalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp_kernel;
      |                                                                                                       ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; int ProductTag = 8; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                                              ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:73:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                                                                         ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, -1, 1>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:73:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                                                                         ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 2, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 2, 1>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 2, 1> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Matrix<double, 2, 1>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:128:31:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:93:22:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholder(EssentialPart&, Scalar&, RealScalar&) const [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   93 |     essential = tail / (c0 - beta);
      |                 ~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:46:18:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:44:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; U = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:34:74:   required from 'static void Eigen::internal::selfadjoint_rank2_update_selector<Scalar, Index, UType, VType, 1>::run(Scalar*, Index, const UType&, const VType&, const Scalar&) [with Scalar = double; Index = long long int; UType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; VType = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>]'
   34 |                         (numext::conj(alpha) * numext::conj(u.coeff(i))) * v.tail(size-i)
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:87:10:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:35:60:   required from 'static void Eigen::internal::selfadjoint_rank2_update_selector<Scalar, Index, UType, VType, 1>::run(Scalar*, Index, const UType&, const VType&, const Scalar&) [with Scalar = double; Index = long long int; UType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; VType = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>]'
   35 |                       + (alpha * numext::conj(v.coeff(i))) * u.tail(size-i);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:87:10:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1, 0, 1, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:35:23:   required from 'static void Eigen::internal::selfadjoint_rank2_update_selector<Scalar, Index, UType, VType, 1>::run(Scalar*, Index, const UType&, const VType&, const Scalar&) [with Scalar = double; Index = long long int; UType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; VType = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>]'
   34 |                         (numext::conj(alpha) * numext::conj(u.coeff(i))) * v.tail(size-i)
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   35 |                       + (alpha * numext::conj(v.coeff(i))) * u.tail(size-i);
      |                       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:87:10:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:50:23:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true>; U = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>; ResScalar = double]'
   50 |     return a.transpose().template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/BlasUtil.h:506:13:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/VectorBlock.h:56:47:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:341:54:   required from 'static void Eigen::internal::trmv_selector<Mode, 1>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false> >; Rhs = Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >; Dest = Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; int Mode = 6; typename Dest::Scalar = double]'
  341 |       dest.head(diagSize) -= (lhs_alpha-LhsScalar(1))*rhs.head(diagSize);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:18:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1>; int Mode = 6; bool LhsIsTriangular = true; Lhs = const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >; Rhs = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; typename Dest::Scalar = double]'
  457 |         dst.topRows(diagSize) -= ((lhs_alpha-LhsScalar(1))*a_rhs).topRows(diagSize);
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const 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::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const 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::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const 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::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const 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::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const 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::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const 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::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:74:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1>; int Mode = 6; bool LhsIsTriangular = true; Lhs = const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >; Rhs = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; typename Dest::Scalar = double]'
  462 |         dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 long int; DataMapper = Eigen::internal::const_blas_data_mapper<double, long long int, 0>; int nr = 4; bool Conjugate = false; bool PanelMode = false]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:175:15:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  175 |       pack_rhs(blockB, rhs.getSubMapper(actual_k2,0), actual_kc, cols);
      |       ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; int ProductTag = 8; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::subTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>]'
  357 |   { scaleAndAddTo(dst, lhs, rhs, Scalar(-1)); }
      |     ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                              ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 long int; DataMapper = Eigen::internal::const_blas_data_mapper<double, long long int, 0>; int Pack1 = 4; int Pack2 = 2; Packet = __vector(2) double; bool Conjugate = false; bool PanelMode = false]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:203:19:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  203 |           pack_lhs(blockA, LhsMapper(triangularBuffer.data(), triangularBuffer.outerStride()), actualPanelWidth, actualPanelWidth);
      |           ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; int ProductTag = 8; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::subTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>]'
  357 |   { scaleAndAddTo(dst, lhs, rhs, Scalar(-1)); }
      |     ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                  ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                              ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 long int; DataMapper = Eigen::internal::blas_data_mapper<double, long long int, 0, 0, 1>; int mr = 4; int nr = 4; bool ConjugateLhs = false; bool ConjugateRhs = false; ResScalar = double]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:205:22:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  205 |           gebp_kernel(res.getSubMapper(startBlock, 0), blockA, blockB,
      |           ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  206 |                       actualPanelWidth, actualPanelWidth, cols, alpha,
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                       actualPanelWidth, actual_kc, 0, blockBOffset);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; int ProductTag = 8; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::subTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>]'
  357 |   { scaleAndAddTo(dst, lhs, rhs, Scalar(-1)); }
      |     ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                       ^~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                          ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:73:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                                                                         ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:78:71:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:142:7:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::coeff(Eigen::Index) const [with Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; CoeffReturnType = const double&; Eigen::Index = long long int]'
  142 |       EIGEN_STATIC_ASSERT(internal::evaluator<Derived>::Flags & LinearAccessBit,
      |                                                         ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:79:20:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholder(EssentialPart&, Scalar&, RealScalar&) const [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   79 |   Scalar c0 = coeff(0);
      |               ~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:46:18:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholderInPlace(Scalar&, RealScalar&) [with Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   46 |   makeHouseholder(essentialPart, tau, beta);
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:363:59:   required from 'void Eigen::internal::tridiagonalization_inplace(MatrixType&, CoeffVectorType&) [with MatrixType = Eigen::Matrix<double, 2, 2>; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  363 |     matA.col(i).tail(remainingSize).makeHouseholderInPlace(h, beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:449:31:   required from 'static void Eigen::internal::tridiagonalization_inplace_selector<MatrixType, Size, IsComplex>::run(MatrixType&, DiagonalType&, SubDiagonalType&, CoeffVectorType&, bool) [with DiagonalType = Eigen::Matrix<double, 2, 1>; SubDiagonalType = Eigen::Matrix<double, 1, 1, 0, 1, 1>; MatrixType = Eigen::Matrix<double, 2, 2>; int Size = 2; bool IsComplex = false; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  449 |     tridiagonalization_inplace(mat, hCoeffs);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:434:55:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:115:7:   required from 'const Eigen::MapBase<Derived, 0>::Scalar& Eigen::MapBase<Derived, 0>::coeff(Eigen::Index) const [with Derived = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Scalar = double; Eigen::Index = long long int]'
   15 |       EIGEN_STATIC_ASSERT((int(internal::evaluator<Derived>::Flags) & LinearAccessBit) || Derived::IsVectorAtCompileTime, \
      |                                                              ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:35:54:   required from 'static void Eigen::internal::selfadjoint_rank2_update_selector<Scalar, Index, UType, VType, 1>::run(Scalar*, Index, const UType&, const VType&, const Scalar&) [with Scalar = double; Index = long long int; UType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; VType = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>]'
   35 |                       + (alpha * numext::conj(v.coeff(i))) * u.tail(size-i);
      |                                               ~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:87:10:   required from 'Eigen::SelfAdjointView<MatrixType, UpLo>& Eigen::SelfAdjointView<MatrixType, Mode>::rankUpdate(const Eigen::MatrixBase<OtherDerived>&, const Eigen::MatrixBase<OtherDerived>&, const Scalar&) [with DerivedU = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; DerivedV = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; _MatrixType = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; unsigned int UpLo = 1; Scalar = double]'
   85 |   internal::selfadjoint_rank2_update_selector<Scalar, Index, UType, VType,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   86 |     (IsRowMajor ? int(UpLo==Upper ? Lower : Upper) : UpLo)>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   87 |     ::run(_expression().const_cast_derived().data(),_expression().outerStride(),UType(actualU),VType(actualV),actualAlpha);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:375:18:   required from 'void Eigen::internal::tridiagonalization_inplace(MatrixType&, CoeffVectorType&) [with MatrixType = Eigen::Matrix<double, 2, 2>; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  374 |     matA.bottomRightCorner(remainingSize, remainingSize).template selfadjointView<Lower>()
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |       .rankUpdate(matA.col(i).tail(remainingSize), hCoeffs.tail(remainingSize), Scalar(-1));
      |       ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:449:31:   required from 'static void Eigen::internal::tridiagonalization_inplace_selector<MatrixType, Size, IsComplex>::run(MatrixType&, DiagonalType&, SubDiagonalType&, CoeffVectorType&, bool) [with DiagonalType = Eigen::Matrix<double, 2, 1>; SubDiagonalType = Eigen::Matrix<double, 1, 1, 0, 1, 1>; MatrixType = Eigen::Matrix<double, 2, 2>; int Size = 2; bool IsComplex = false; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  449 |     tridiagonalization_inplace(mat, hCoeffs);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:434:55:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Buffer = d_ary_heap_indirect<long long unsigned int, 4, iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long long unsigned int, 4, iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, long long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, detail::_project2nd<float, float>, std::less<float> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; SourceIterator = long long unsigned int*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistZero = float; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistInf = float; DistZero = float; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistInf = float; DistZero = float; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  417 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  418 |         index_map, compare, combine, inf, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistInf = float; DistZero = float]'
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function 'boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >::~IncidenceGraphConcept()'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro 'BOOST_concept'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> >, CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Buffer = d_ary_heap_indirect<long long unsigned int, 4, iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long long unsigned int, 4, iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, long long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, detail::_project2nd<float, float>, std::less<float> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; SourceIterator = long long unsigned int*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistZero = float; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistInf = float; DistZero = float; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistInf = float; DistZero = float; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  417 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  418 |         index_map, compare, combine, inf, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistInf = float; DistZero = float]'
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function 'void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> >; Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >]'
   37 |     void constraints()
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Buffer = d_ary_heap_indirect<long long unsigned int, 4, iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long long unsigned int, 4, iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, long long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, detail::_project2nd<float, float>, std::less<float> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; SourceIterator = long long unsigned int*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistZero = float; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistInf = float; DistZero = float; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistInf = float; DistZero = float; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  417 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  418 |         index_map, compare, combine, inf, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistInf = float; DistZero = float]'
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                                               ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:115:18:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                                               ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:119:18:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:137:106:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, 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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_product_op<double, double>, 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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, 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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:137:77:   required from 'static void Eigen::internal::triangular_matrix_vector_product<Index, Mode, LhsScalar, ConjLhs, RhsScalar, ConjRhs, 1, Version>::run(Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, const ResScalar&) [with Index = long long int; int Mode = 6; LhsScalar = double; bool ConjLhs = false; RhsScalar = double; bool ConjRhs = false; int Version = 0; ResScalar = double]'
  137 |           res.coeffRef(i) += alpha * (cjLhs.row(i).segment(s,r).cwiseProduct(cjRhs.segment(s,r).transpose())).sum();
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:332:12:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 8, 8, 1, 8, 8> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 8, 8, 1, 8, 8> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 8, 8, 1, 8, 8> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:153:32:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 8, 8, 0, 8, 8> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 8, 8, 0, 8, 8> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 8, 8, 0, 8, 8> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 8, 8, 0, 8, 8> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Matrix<double, 8, 8, 0, 8, 8>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Matrix<double, 8, 8, 0, 8, 8>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:151:29:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 8, 1, 0, 8, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 8, 1, 0, 8, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 8, 1, 0, 8, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 8, 1, 0, 8, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:153:42:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:50:23:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:73:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                                                                         ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true>; U = Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true>; ResScalar = double]'
   50 |     return a.transpose().template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:73:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                                                                         ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:86:22:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::Graph<G>::~Graph() [with G = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:165:3:   required from 'struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> > >'
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:39:9:   required from 'void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> >; Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> >, CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> >, CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> >, CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> >, CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:65:5:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function 'boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> > >::~CopyConstructibleConcept()'
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro 'BOOST_concept'
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<CGAL::internal::MST_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; BFSVisitor = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = boost::bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::MST_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick>; P = bfs_visitor<CGAL::internal::Propagate_normal_orientation<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >, CGAL::Epick> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:709:32:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  709 |     boost::breadth_first_search(mst_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  710 |                                 vertex(source_point_index, mst_graph), // source
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  711 |                                 visitor(boost::make_bfs_visitor(orienter)));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -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::Map<Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -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::Map<Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -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::Map<Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -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::Map<Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >; Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:305:153:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:21:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  170 |     right.noalias() -= tau * tmp * essential.adjoint();
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of 'void Eigen::internal::gemm_pack_lhs<Scalar, Index, DataMapper, Pack1, Pack2, Packet, 1, Conjugate, PanelMode>::operator()(Scalar*, const DataMapper&, Index, Index, Index, Index) [with Scalar = double; Index = long long int; DataMapper = Eigen::internal::const_blas_data_mapper<double, long long int, 1>; int Pack1 = 4; int Pack2 = 2; Packet = __vector(2) double; bool Conjugate = false; bool PanelMode = false]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:203:19:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 6; int LhsStorageOrder = 1; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  203 |           pack_lhs(blockA, LhsMapper(triangularBuffer.data(), triangularBuffer.outerStride()), actualPanelWidth, actualPanelWidth);
      |           ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1>; int Mode = 6; bool LhsIsTriangular = true; Lhs = const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >; Rhs = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix<double, -1, -1>; Lhs = Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>; Rhs = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int ProductTag = 8; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Matrix<double, -1, -1>; Lhs = Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>; Rhs = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::TriangularShape, Eigen::DenseShape, 8>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:33:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix<double, -1, -1>; Lhs = Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>; Rhs = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::TriangularShape, Eigen::DenseShape, 8>]'
  349 |   { dst.setZero(); scaleAndAddTo(dst, lhs, rhs, Scalar(1)); }
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2256:82: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
 2256 |   typedef typename unpacket_traits<typename unpacket_traits<Packet>::half>::half QuarterPacket;
      |                                                                                  ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2258:56: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
 2258 |          HalfPacketSize = unpacket_traits<HalfPacket>::size,
      |                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2259:62: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
 2259 |          QuarterPacketSize = unpacket_traits<QuarterPacket>::size,
      |                                                              ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2259:62: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2298:39: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
 2298 |               PacketBlock<HalfPacket> kernel_half;
      |                                       ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2298:39: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2304:42: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
 2304 |               PacketBlock<QuarterPacket> kernel_quarter;
      |                                          ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2304:42: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2304:42: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2304:42: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:564:45:   required from 'struct Eigen::internal::unary_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  564 |     CoeffReadCost = int(evaluator<ArgType>::CoeffReadCost) + int(functor_traits<UnaryOp>::Cost),
      |                                             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<long long unsigned int*>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<long long unsigned int*>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<long long unsigned int*>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<long long unsigned int*>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<long long unsigned int*>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<long long unsigned int*>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<long long unsigned int*>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<long long unsigned int*>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<long long unsigned int*>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<long long unsigned int*>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<long long unsigned int*>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<long long unsigned int*>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<long long unsigned int*>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<long long unsigned int*>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<long long unsigned int*>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<long long unsigned int*>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<long long unsigned int*>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<long long unsigned int*>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<long long unsigned int*>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<long long unsigned int*>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long long unsigned int*; ID = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long long unsigned int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46:   required from 'static boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::type boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; IndexMap = boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Value = long long unsigned int; type = boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>]'
  245 |             return make_iterator_property_map(array_holder.get(), index);
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33:   required from 'static boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::type boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; IndexMap = boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Value = long long unsigned int; type = boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>]'
  273 |             return helper::build(g, index, array_holder);
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:377:38:   required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistZero = float; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  377 |         = IndexInHeapMapHelper::build(g, index_map, index_in_heap_map_holder);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistInf = float; DistZero = float; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function 'boost::RandomAccessIteratorConcept<long long unsigned int*>::~RandomAccessIteratorConcept()'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro 'BOOST_concept'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Buffer = d_ary_heap_indirect<long long unsigned int, 4, iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long long unsigned int, 4, iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, long long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, detail::_project2nd<float, float>, std::less<float> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; SourceIterator = long long unsigned int*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistZero = float; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistInf = float; DistZero = float; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Buffer = d_ary_heap_indirect<long long unsigned int, 4, iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long long unsigned int, 4, iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, long long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, detail::_project2nd<float, float>, std::less<float> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; SourceIterator = long long unsigned int*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistZero = float; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistInf = float; DistZero = float; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Buffer = d_ary_heap_indirect<long long unsigned int, 4, iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long long unsigned int, 4, iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, long long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, detail::_project2nd<float, float>, std::less<float> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; SourceIterator = long long unsigned int*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistZero = float; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistInf = float; DistZero = float; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Buffer = d_ary_heap_indirect<long long unsigned int, 4, iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long long unsigned int, 4, iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, long long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, detail::_project2nd<float, float>, std::less<float> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; SourceIterator = long long unsigned int*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistZero = float; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistInf = float; DistZero = float; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Buffer = d_ary_heap_indirect<long long unsigned int, 4, iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long long unsigned int, 4, iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, long long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, detail::_project2nd<float, float>, std::less<float> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; SourceIterator = long long unsigned int*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistZero = float; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>; WeightMap = adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>; Compare = std::less<float>; Combine = detail::_project2nd<float, float>; DistInf = float; DistZero = float; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >]'
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:165:3:   required from 'struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> > >'
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long long unsigned int, 4, boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, long long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, boost::detail::_project2nd<float, float>, std::less<float> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:50:63:   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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true>; U = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>; ResScalar = double]'
   50 |     return a.transpose().template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   required from 'typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType Eigen::MatrixBase<Derived>::dot(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>; Derived = Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true>; typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType = double; typename Eigen::internal::traits<T>::Scalar = double; typename Eigen::internal::traits<OtherDerived>::Scalar = double]'
   84 |   return internal::dot_nocheck<Derived,OtherDerived>::run(*this, other);
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:380:62:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/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>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/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>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, 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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, 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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 8, 8, 1, 8, 8> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 8, 8, 1, 8, 8> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 8, 8, 1, 8, 8> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 8, 8, 1, 8, 8> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Matrix<double, 8, 8, 1, 8, 8>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Matrix<double, 8, 8, 1, 8, 8>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:151:29:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 1, 0, 8, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 1, 0, 8, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 1, 0, 8, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 8, 1, 0, 8, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 8, 1, 0, 8, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 8, 1, 0, 8, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const 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::Matrix<double, -1, -1> >, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, const Eigen::Matrix<double, -1, -1> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; SrcXprType = Eigen::Block<const 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::Matrix<double, -1, -1> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, const Eigen::Matrix<double, -1, -1> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, const Eigen::Matrix<double, -1, -1> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const 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::Matrix<double, -1, -1> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/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>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -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<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -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<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true> >':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -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<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -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<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -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<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -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<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> >; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:32:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:73:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                                                                         ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:73:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                                                                         ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>; SrcXprType = Eigen::Matrix<double, 2, 1>; Functor = assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>; SrcXprType = Eigen::Matrix<double, 2, 1>; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>; Src = Eigen::Matrix<double, 2, 1>; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>; Src = Eigen::Matrix<double, 2, 1>; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>; Src = Eigen::Matrix<double, 2, 1>]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Assign.h:66:28:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:16:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:166:45:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:51:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; U = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   required from 'typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType Eigen::MatrixBase<Derived>::dot(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType = double; typename Eigen::internal::traits<T>::Scalar = double; typename Eigen::internal::traits<OtherDerived>::Scalar = double]'
   84 |   return internal::dot_nocheck<Derived,OtherDerived>::run(*this, other);
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:372:86:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<long long unsigned int*>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<long long unsigned int*>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<long long unsigned int*>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<long long unsigned int*>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<long long unsigned int*>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<long long unsigned int*>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<long long unsigned int*>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<long long unsigned int*>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<long long unsigned int*>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<long long unsigned int*>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<long long unsigned int*>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<long long unsigned int*>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<long long unsigned int*>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<long long unsigned int*>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<long long unsigned int*>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<long long unsigned int*>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Comparable<TT>::~Comparable() [with TT = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<long long unsigned int*>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:50:63:   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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true>; U = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>; ResScalar = double]'
   50 |     return a.transpose().template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   required from 'typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType Eigen::MatrixBase<Derived>::dot(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>; Derived = Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true>; typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType = double; typename Eigen::internal::traits<T>::Scalar = double; typename Eigen::internal::traits<OtherDerived>::Scalar = double]'
   84 |   return internal::dot_nocheck<Derived,OtherDerived>::run(*this, other);
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:380:62:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:101:19:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  101 |   if(forward) tmp = T.template triangularView<Upper>()           * tmp;
      |               ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1>; int Mode = 2; bool LhsIsTriangular = true; Lhs = Eigen::Matrix<double, -1, -1, 1, -1, -1>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  462 |         dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:101:19:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  101 |   if(forward) tmp = T.template triangularView<Upper>()           * tmp;
      |               ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:102:19:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  102 |   else        tmp = T.template triangularView<Upper>().adjoint() * tmp;
      |               ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1>; int Mode = 1; bool LhsIsTriangular = true; Lhs = const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  462 |         dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:102:19:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  102 |   else        tmp = T.template triangularView<Upper>().adjoint() * tmp;
      |               ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:46:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:78:71:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholder(EssentialPart&, Scalar&, RealScalar&) const [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   78 |   RealScalar tailSqNorm = size()==1 ? RealScalar(0) : tail.squaredNorm();
      |                                                       ~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:46:18:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1>, -1, 1, false>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41:   required from 'struct Eigen::internal::binary_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Buffer = d_ary_heap_indirect<long long unsigned int, 4, iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long long unsigned int, 4, iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, std::less<float>, std::vector<long long unsigned int> >, adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, long long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int>, float, float&>, detail::_project2nd<float, float>, std::less<float> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<CGAL::internal::Riemannian_graph_vertex_properties<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >, long long unsigned int> >; SourceIterator = long long unsigned int*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, 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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:137:114:   required from 'static void Eigen::internal::triangular_matrix_vector_product<Index, Mode, LhsScalar, ConjLhs, RhsScalar, ConjRhs, 1, Version>::run(Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, const ResScalar&) [with Index = long long int; int Mode = 6; LhsScalar = double; bool ConjLhs = false; RhsScalar = double; bool ConjRhs = false; int Version = 0; ResScalar = double]'
  137 |           res.coeffRef(i) += alpha * (cjLhs.row(i).segment(s,r).cwiseProduct(cjRhs.segment(s,r).transpose())).sum();
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:332:12:   required from 'static void Eigen::internal::trmv_selector<Mode, 1>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false> >; Rhs = Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >; Dest = Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; int Mode = 6; typename Dest::Scalar = double]'
  327 |     internal::triangular_matrix_vector_product
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  328 |       <Index,Mode,
      |       ~~~~~~~~~~~~
  329 |        LhsScalar, LhsBlasTraits::NeedToConjugate,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  330 |        RhsScalar, RhsBlasTraits::NeedToConjugate,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  331 |        RowMajor>
      |        ~~~~~~~~~
  332 |       ::run(actualLhs.rows(),actualLhs.cols(),
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  333 |             actualLhs.data(),actualLhs.outerStride(),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  334 |             actualRhsPtr,1,
      |             ~~~~~~~~~~~~~~~
  335 |             dest.data(),dest.innerStride(),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  336 |             actualAlpha);
      |             ~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:18:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/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>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1043:41:   required from 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
 1043 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; 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::Transpose<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; 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::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; 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::Transpose<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; 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::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; Src = 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::Transpose<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; Src = 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::Transpose<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<const Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Derived = Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:341:27:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const 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::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const 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::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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, true>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, true>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:32:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<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());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<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>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:50:63:   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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true>; U = Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true>; ResScalar = double]'
   50 |     return a.transpose().template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   required from 'typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType Eigen::MatrixBase<Derived>::dot(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true>; Derived = Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true>; typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType = double; typename Eigen::internal::traits<T>::Scalar = double; typename Eigen::internal::traits<OtherDerived>::Scalar = double]'
   84 |   return internal::dot_nocheck<Derived,OtherDerived>::run(*this, other);
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:380:62:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:73:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                                                                         ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:73:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                                                                         ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; SrcXprType = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >; Functor = assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; SrcXprType = Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Assign.h:66:28:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:337:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h: In instantiation of 'static void Eigen::internal::selfadjoint_matrix_vector_product<Scalar, Index, StorageOrder, UpLo, ConjugateLhs, ConjugateRhs, Version>::run(Index, const Scalar*, Index, const Scalar*, Scalar*, Scalar) [with Scalar = double; Index = long long int; int StorageOrder = 0; int UpLo = 1; bool ConjugateLhs = false; bool ConjugateRhs = false; int Version = 0]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:229:7:   required from 'static void Eigen::internal::selfadjoint_product_impl<Lhs, LhsMode, false, Rhs, 0, true>::run(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; int LhsMode = 17; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Scalar = double]'
  227 |     internal::selfadjoint_matrix_vector_product<Scalar, Index, (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  228 |                                                 int(LhsUpLo), bool(LhsBlasTraits::NeedToConjugate), bool(RhsBlasTraits::NeedToConjugate)>::run
      |                                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  229 |       (
      |       ^
  230 |         lhs.rows(),                             // size
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  231 |         &lhs.coeffRef(0,0),  lhs.outerStride(), // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  232 |         actualRhsPtr,                           // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  233 |         actualDestPtr,                          // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  234 |         actualAlpha                             // scale factor
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  235 |       );
      |       ~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:805:109:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::SelfAdjointShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; int ProductTag = 3; Scalar = double]'
  805 |     selfadjoint_product_impl<typename Lhs::MatrixType,Lhs::Mode,false,Rhs,0,Rhs::IsVectorAtCompileTime>::run(dst, lhs.nestedExpression(), rhs, alpha);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Derived = Eigen::internal::generic_product_impl<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, Eigen::SelfAdjointShape, Eigen::DenseShape, 3>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:33:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Derived = Eigen::internal::generic_product_impl<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, Eigen::SelfAdjointShape, Eigen::DenseShape, 3>]'
  349 |   { dst.setZero(); scaleAndAddTo(dst, lhs, rhs, Scalar(1)); }
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::Product<Lhs, Rhs, Options>, Eigen::internal::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::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; int Options = 0; Scalar = double; SrcXprType = Eigen::Product<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>]'
  148 |     generic_product_impl<Lhs, Rhs>::evalTo(dst, src.lhs(), src.rhs());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:62:121: warning: ignoring attributes on template argument 'Eigen::internal::packet_traits<double>::type' {aka '__m128d'} [-Wignored-attributes]
   62 |   conj_helper<Packet,Packet,NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(ConjugateLhs,  IsRowMajor), ConjugateRhs> pcj0;
      |                                                                                                                         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:62:121: warning: ignoring attributes on template argument 'Eigen::internal::packet_traits<double>::type' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:63:121: warning: ignoring attributes on template argument 'Eigen::internal::packet_traits<double>::type' {aka '__m128d'} [-Wignored-attributes]
   63 |   conj_helper<Packet,Packet,NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(ConjugateLhs, !IsRowMajor), ConjugateRhs> pcj1;
      |                                                                                                                         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:63:121: warning: ignoring attributes on template argument 'Eigen::internal::packet_traits<double>::type' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 2, 2>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; Param = detail::_project2nd<float, float>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<float>, distance_compare_t, bgl_named_params<long long unsigned int*, vertex_predecessor_t, bgl_named_params<long long unsigned int, root_vertex_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property> > > >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; P = long long unsigned int*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<long long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, float, const float&, long long unsigned int, const boost::property<boost::edge_weight_t, float>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:67:26:   required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap, const bgl_named_params<P, T, R>&) [with VertexListGraph = CGAL::internal::Riemannian_graph<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > > >; PredecessorMap = long long unsigned int*; P = long long unsigned int; T = root_vertex_t; R = bgl_named_params<adj_list_edge_property_map<undirected_tag, float, const float&, long long unsigned int, const property<edge_weight_t, float>, edge_weight_t>, edge_weight_t, no_property>]'
   67 |     detail::prim_mst_impl(g,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~
   68 |         choose_param(get_param(params, root_vertex_t()), *vertices(g).first),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |         params.predecessor_map(p_map),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:489:38:   required from 'CGAL::internal::MST_graph<ForwardIterator, NormalMap, Kernel> CGAL::internal::create_mst_graph(ForwardIterator, ForwardIterator, PointMap, NormalMap, IndexMap, unsigned int, const Kernel&, const Riemannian_graph<ForwardIterator>&) [with ForwardIterator = __gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; PointMap = CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; NormalMap = CGAL::Second_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >; IndexMap = CGAL::Index_property_map<__gnu_cxx::__normal_iterator<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> >*, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >, std::random_access_iterator_tag>; Kernel = CGAL::Epick]'
  489 |     boost::prim_minimum_spanning_tree(riemannian_graph, &predecessor[0],
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  490 |                                       weight_map( riemannian_graph_weight_map )
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  491 |                                      .root_vertex( vertex(source_point_index, riemannian_graph) ));
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/mst_orient_normals.h:693:43:   required from 'typename PointRange::iterator CGAL::mst_orient_normals(PointRange&, unsigned int, const NamedParameters&) [with PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >; typename PointRange::iterator = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >::iterator]'
  693 |     MST_graph mst_graph = create_mst_graph(points.begin(), points.end(),
      |                           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  694 |                                            point_map, normal_map, index_map,
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  695 |                                            k,
      |                                            ~~
  696 |                                            kernel,
      |                                            ~~~~~~~
  697 |                                            riemannian_graph);
      |                                            ~~~~~~~~~~~~~~~~~
export_normals.cpp:50:27:   required from here
   50 |   CGAL::mst_orient_normals(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
   51 |       points_vn, nNeighbors,
      |       ~~~~~~~~~~~~~~~~~~~~~~
   52 |       CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   53 |                       .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> >, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::property<boost::edge_weight_t, float> > >, boost::property<boost::edge_weight_t, float> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:166:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/Memory.h: In instantiation of 'Index Eigen::internal::first_default_aligned(const Scalar*, Index) [with Scalar = double; Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:89:68:   required from 'static void Eigen::internal::selfadjoint_matrix_vector_product<Scalar, Index, StorageOrder, UpLo, ConjugateLhs, ConjugateRhs, Version>::run(Index, const Scalar*, Index, const Scalar*, Scalar*, Scalar) [with Scalar = double; Index = long long int; int StorageOrder = 0; int UpLo = 1; bool ConjugateLhs = false; bool ConjugateRhs = false; int Version = 0]'
   89 |     Index alignedStart = (starti) + internal::first_default_aligned(&res[starti], endi-starti);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:229:7:   required from 'static void Eigen::internal::selfadjoint_product_impl<Lhs, LhsMode, false, Rhs, 0, true>::run(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; int LhsMode = 17; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Scalar = double]'
  227 |     internal::selfadjoint_matrix_vector_product<Scalar, Index, (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  228 |                                                 int(LhsUpLo), bool(LhsBlasTraits::NeedToConjugate), bool(RhsBlasTraits::NeedToConjugate)>::run
      |                                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  229 |       (
      |       ^
  230 |         lhs.rows(),                             // size
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  231 |         &lhs.coeffRef(0,0),  lhs.outerStride(), // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  232 |         actualRhsPtr,                           // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  233 |         actualDestPtr,                          // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  234 |         actualAlpha                             // scale factor
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  235 |       );
      |       ~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:805:109:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::SelfAdjointShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; int ProductTag = 3; Scalar = double]'
  805 |     selfadjoint_product_impl<typename Lhs::MatrixType,Lhs::Mode,false,Rhs,0,Rhs::IsVectorAtCompileTime>::run(dst, lhs.nestedExpression(), rhs, alpha);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Derived = Eigen::internal::generic_product_impl<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, Eigen::SelfAdjointShape, Eigen::DenseShape, 3>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:33:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Derived = Eigen::internal::generic_product_impl<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, Eigen::SelfAdjointShape, Eigen::DenseShape, 3>]'
  349 |   { dst.setZero(); scaleAndAddTo(dst, lhs, rhs, Scalar(1)); }
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/Memory.h:500:60: warning: ignoring attributes on template argument 'Eigen::internal::packet_traits<double>::type' {aka '__m128d'} [-Wignored-attributes]
  500 |   return first_aligned<unpacket_traits<DefaultPacketType>::alignment>(array, size);
      |                                                            ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, 2, 2>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, 2, 2>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, -1, -1, 0, 2, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 0, 2, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, 2, 2> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:27:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:169:25:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Scalar = double]'
  169 |     this->col(0) -= tau * tmp;
      |                     ~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:53:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:34:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 1, -1, 1, 1, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 1, -1, 1, 1, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 1, -1, 1, 1, 2> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:41:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:131:25:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Scalar = double]'
  131 |     this->row(0) -= tau * tmp;
      |                     ~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:132:29:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Scalar = double]'
  132 |     bottom.noalias() -= tau * essential * tmp;
      |                         ~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:132:41:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:50:23:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:73:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                                                                         ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false>; U = Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true>; ResScalar = double]'
   50 |     return a.transpose().template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:73:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                                                                         ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:20:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator*=(const Scalar&) [with Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Scalar = double]'
   20 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:161:11:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Scalar = double]'
  161 |     *this *= Scalar(1)-tau;
      |     ~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:175:44:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:96:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:101:66:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:102:66:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:22:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:63:90:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:63:57:   required from 'void Eigen::internal::make_block_householder_triangular_factor(TriangularFactorType&, const VectorsType&, const CoeffsType&) [with TriangularFactorType = Eigen::Matrix<double, -1, -1, 1, -1, -1>; VectorsType = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1>]'
   63 |       triFactor.row(i).tail(rt).noalias() = -hCoeffs(i) * vectors.col(i).tail(rs).adjoint()
      |                                             ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 5>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 5>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 5>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 5>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 5>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 5>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:64:57:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:101:19:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  101 |   if(forward) tmp = T.template triangularView<Upper>()           * tmp;
      |               ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:102:19:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  102 |   else        tmp = T.template triangularView<Upper>().adjoint() * tmp;
      |               ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:114:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
      |                                                                                                                  ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:73:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
      |                                                                         ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:416:50:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:416:50:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:142:7:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::coeff(Eigen::Index) const [with Derived = Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  142 |       EIGEN_STATIC_ASSERT(internal::evaluator<Derived>::Flags & LinearAccessBit,
      |                                                         ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:182:19:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::operator()(Eigen::Index) const [with Derived = Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  182 |       return coeff(index);
      |              ~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:63:53:   required from 'void Eigen::internal::make_block_householder_triangular_factor(TriangularFactorType&, const VectorsType&, const CoeffsType&) [with TriangularFactorType = Eigen::Matrix<double, -1, -1, 1, -1, -1>; VectorsType = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1>]'
   63 |       triFactor.row(i).tail(rt).noalias() = -hCoeffs(i) * vectors.col(i).tail(rs).adjoint()
      |                                              ~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, 2, 2>; Workspace = Eigen::Matrix<double, 2, 1>; VectorsType = Eigen::Matrix<double, 2, 2>; CoeffsType = Eigen::Matrix<double, 1, 1, 0, 1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:320:29:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>; SrcXprType = Eigen::CwiseNullaryOp<scalar_constant_op<double>, Eigen::Matrix<double, -1, -1, 0, 2, 2> >; Functor = mul_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>; SrcXprType = Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, -1, -1, 0, 2, 2> >; Functor = Eigen::internal::mul_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>; Src = Eigen::CwiseNullaryOp<scalar_constant_op<double>, Eigen::Matrix<double, -1, -1, 0, 2, 2> >; Func = mul_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>; Src = Eigen::CwiseNullaryOp<scalar_constant_op<double>, Eigen::Matrix<double, -1, -1, 0, 2, 2> >; Func = mul_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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:20:28:   required from 'Derived& Eigen::DenseBase<Derived>::operator*=(const Scalar&) [with Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Scalar = double]'
   20 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:161:11:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>; Functor = add_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>; Functor = Eigen::internal::add_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>; Func = add_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>; Func = add_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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:177:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator+=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>; Derived = Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >]'
  177 |   call_assignment(derived(), other.derived(), internal::add_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:168:9:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>; Functor = add_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>; Functor = Eigen::internal::add_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>; Func = add_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>; Func = add_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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:177:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator+=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>; Derived = Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >]'
  177 |   call_assignment(derived(), other.derived(), internal::add_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:130:9:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, -1, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, -1, 2>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, -1, 2>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, -1, -1, 0, -1, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 0, -1, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, 2> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Dense>'
  372 |   typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type;
      |                                                                                                      ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:526:76:   required from 'struct Eigen::internal::product_evaluator<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>, 3, Eigen::DenseShape, Eigen::DenseShape, double, double>'
  526 |   typedef typename internal::nested_eval<Lhs,Rhs::ColsAtCompileTime>::type LhsNested;
      |                                                                            ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:29:8:   required from 'struct Eigen::internal::evaluator<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1> >'
   29 | struct evaluator<Product<Lhs, Rhs, Options> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>; Functor = assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, Eigen::Dense>'
  372 |   typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type;
      |                                                                                                      ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:527:76:   required from 'struct Eigen::internal::product_evaluator<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>, 3, Eigen::DenseShape, Eigen::DenseShape, double, double>'
  527 |   typedef typename internal::nested_eval<Rhs,Lhs::RowsAtCompileTime>::type RhsNested;
      |                                                                            ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:29:8:   required from 'struct Eigen::internal::evaluator<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1> >'
   29 | struct evaluator<Product<Lhs, Rhs, Options> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>; Functor = assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1, 0, 2, 2>; typename Dest::Scalar = double]'
  457 |         dst.topRows(diagSize) -= ((lhs_alpha-LhsScalar(1))*a_rhs).topRows(diagSize);
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:74:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1, 0, 2, 2>; typename Dest::Scalar = double]'
  462 |         dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>, -1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:32:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:48:   required from 'static void Eigen::internal::triangular_product_impl<Mode, false, Lhs, true, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; int Mode = 5; Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >; Rhs = const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; typename Dest::Scalar = double]'
  194 |             ::run(rhs.transpose(),lhs.transpose(), dstT, alpha);
      |                                   ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:783:113:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618:37:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618: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) const [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; Rhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  618 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/BlasUtil.h:506:13:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/VectorBlock.h:56:47:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:341:54:   required from 'static void Eigen::internal::trmv_selector<Mode, 1>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >; Rhs = Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >; Dest = Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; int Mode = 6; typename Dest::Scalar = double]'
  341 |       dest.head(diagSize) -= (lhs_alpha-LhsScalar(1))*rhs.head(diagSize);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:18:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 29 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1, 0, 2, 2>; int Mode = 6; bool LhsIsTriangular = true; Lhs = const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >; Rhs = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; typename Dest::Scalar = double]'
  457 |         dst.topRows(diagSize) -= ((lhs_alpha-LhsScalar(1))*a_rhs).topRows(diagSize);
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:74:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 29 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1, 0, 2, 2>; int Mode = 6; bool LhsIsTriangular = true; Lhs = const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >; Rhs = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; typename Dest::Scalar = double]'
  462 |         dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 1, 2, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 1, 2, 2>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 1, 2, 2>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, -1, -1, 1, 2, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 1, 2, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 1, 2, 2> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618:37:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618: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) const [with Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  618 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:37:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >; Rhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; int ProductTag = 4; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; Rhs = Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >; int ProductTag = 4; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 29 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 30 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 30 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Matrix<double, -1, -1, 0, -1, 2>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Matrix<double, -1, -1, 0, -1, 2>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:16:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:32:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; 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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618:75:   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) const [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; Rhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  618 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61:   required from 'void Eigen::internal::generic_dense_assignment_kernel<DstEvaluatorTypeT, SrcEvaluatorTypeT, Functor, Version>::assignCoeff(Eigen::Index) [with DstEvaluatorTypeT = Eigen::internal::evaluator<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > >; SrcEvaluatorTypeT = Eigen::internal::evaluator<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1> >; Functor = Eigen::internal::assign_op<double, double>; int Version = 0; Eigen::Index = long long int]'
  660 |     m_functor.assignCoeff(m_dst.coeffRef(index), m_src.coeff(index));
      |                                                  ~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:518:25:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 33 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 33 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1043:41:   required from 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
 1043 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   [ skipping 43 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 41 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; 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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, true>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, true>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, true>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, true>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:32:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 29 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, true>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, true>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, true>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:32:   [ skipping 29 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:5:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  524 |     (W, eval, evec);
      |     ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:3:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
      |   ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:81:36:   required from 'typename NeighborQuery::Kernel::Vector_3 CGAL::internal::jet_estimate_normal(const typename NeighborQuery::Point_3&, const NeighborQuery&, unsigned int, typename NeighborQuery::FT, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > >&, CGAL::First_of_pair_property_map<std::pair<CGAL::Point_3<CGAL::Epick>, CGAL::Vector_3<CGAL::Epick> > > >; typename NeighborQuery::Kernel::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::FT = double]'
   81 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
      |                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   82 |                                     degree_fitting, degree_monge);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_estimate_normals.h:247:13:   required from 'void CGAL::jet_estimate_normals(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NamedParameters = Named_function_parameters<Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::normal_t, Named_function_parameters<First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >, internal_np::point_t, internal_np::No_property> >]'
  246 |             CGAL::internal::jet_estimate_normal<SvdTraits>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  247 |             (get(point_map, vt), neighbor_query, k, neighbor_radius, degree_fitting));
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_normals.cpp:37:42:   required from here
   37 |       CGAL::jet_estimate_normals<PIA_TAG>(
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   38 |           points_vn, nNeighbors,
      |           ~~~~~~~~~~~~~~~~~~~~~~          
   39 |           CGAL::parameters::point_map(CGAL::First_of_pair_property_map<P3V3>())
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                           .normal_map(CGAL::Second_of_pair_property_map<P3V3>()));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:341:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h: In function 'static void Eigen::internal::trmv_selector<Mode, 1>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false> >; Rhs = Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >; Dest = Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; int Mode = 6]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:332:12: warning: 'result' may be used uninitialized [-Wmaybe-uninitialized]
  327 |     internal::triangular_matrix_vector_product
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  328 |       <Index,Mode,
      |       ~~~~~~~~~~~~
  329 |        LhsScalar, LhsBlasTraits::NeedToConjugate,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  330 |        RhsScalar, RhsBlasTraits::NeedToConjugate,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  331 |        RowMajor>
      |        ~~~~~~~~~
  332 |       ::run(actualLhs.rows(),actualLhs.cols(),
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  333 |             actualLhs.data(),actualLhs.outerStride(),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  334 |             actualRhsPtr,1,
      |             ~~~~~~~~~~~~~~~
  335 |             dest.data(),dest.innerStride(),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  336 |             actualAlpha);
      |             ~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:105:24: note: by argument 5 of type 'const double*' to 'static void Eigen::internal::triangular_matrix_vector_product<Index, Mode, LhsScalar, ConjLhs, RhsScalar, ConjRhs, 1, Version>::run(Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, const ResScalar&) [with Index = long long int; int Mode = 6; LhsScalar = double; bool ConjLhs = false; RhsScalar = double; bool ConjRhs = false; int Version = 0]' declared here
  105 | EIGEN_DONT_INLINE void triangular_matrix_vector_product<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ConjRhs,RowMajor,Version>
      |                        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
g++  -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.7/BH/include' -I'D:/RCompile/CRANpkg/lib/4.7/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"   -DCGAL_HEADER_ONLY=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c export_read_write.cpp -o export_read_write.o
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:205,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dimension.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Bbox_2.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic_classes.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
                 from SurfaceMesh.h:17,
                 from export_read_write.cpp:14:
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                       ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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) {
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:174:
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/bind.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian_converter.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Filtered_kernel.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:21:
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/property_map.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
                 from SurfaceMesh.h:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/std_thread.h:43,
                 from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/thread:45,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/config.h:428,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20:
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
g++  -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.7/BH/include' -I'D:/RCompile/CRANpkg/lib/4.7/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"   -DCGAL_HEADER_ONLY=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c export_reconstruct.cpp -o export_reconstruct.o
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:205,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dimension.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Bbox_2.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic_classes.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
                 from SurfaceMesh.h:17,
                 from export_reconstruct.cpp:14:
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                       ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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) {
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:174:
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/bind.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian_converter.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Filtered_kernel.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:21:
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/property_map.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
                 from SurfaceMesh.h:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/std_thread.h:43,
                 from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/thread:45,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/config.h:428,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20:
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:165:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<float, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<float> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46:   required from here
   24 |     ResAlignment = traits<Quaternion<float> >::Alignment
      |                                              ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:271:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<float, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<float, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<float> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<float>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3:   required from here
   27 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<double> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47:   required from here
   98 |     ResAlignment = traits<Quaternion<double> >::Alignment
      |                                               ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<double> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<double>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3:   required from here
  102 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bind/mem_fn.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bind/bind.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multi_index/detail/ord_index_impl.hpp:82,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multi_index/ordered_index.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:37,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:26,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:43,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:61,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_complex_3_in_triangulation_3.h:37,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:18,
                 from export_reconstruct.cpp:21:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/get_pointer.hpp: At global scope:
D:/RCompile/CRANpkg/lib/4.7/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)
      |                                        ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_sequence_adapter.hpp:20,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_vector.hpp:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/mesh_standard_criteria.h:26,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/mesh_standard_facet_criteria.h:29,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_facet_criteria_3.h:24,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_criteria_3.h:28,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:357:49: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  357 |         explicit reversible_ptr_container( std::auto_ptr<PtrContainer> clone )
      |                                                 ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:383:51: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  383 |         reversible_ptr_container& operator=( std::auto_ptr<PtrContainer> clone ) // nothrow
      |                                                   ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:618:48: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  618 |         iterator insert( iterator before, std::auto_ptr<U> x )
      |                                                ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:689:49: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  689 |         auto_type replace( iterator where, std::auto_ptr<U> x )
      |                                                 ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:717:48: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  717 |         auto_type replace( size_type idx, std::auto_ptr<U> x )
      |                                                ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_sequence_adapter.hpp:223:45: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  223 |         explicit ptr_sequence_adapter( std::auto_ptr<PtrContainer> clone )
      |                                             ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_sequence_adapter.hpp:242:47: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  242 |         ptr_sequence_adapter& operator=( std::auto_ptr<PtrContainer> clone )
      |                                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_sequence_adapter.hpp:271:30: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  271 |         void push_back( std::auto_ptr<U> x )
      |                              ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_sequence_adapter.hpp:294:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |         void push_front( std::auto_ptr<U> x )
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:747:23: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  747 |     explicit PC( std::auto_ptr<this_type> r )       \
      |                       ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:808:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_COPY_AND_ASSIGN_AUTO'
  808 |     BOOST_PTR_CONTAINER_COPY_AND_ASSIGN_AUTO( PC, base_type, this_type )   \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE'
  840 |    BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
      |    ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS'
  843 |     BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type )  \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS'
   64 |         BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:750:25: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  750 |     PC& operator=( std::auto_ptr<this_type> r )     \
      |                         ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:808:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_COPY_AND_ASSIGN_AUTO'
  808 |     BOOST_PTR_CONTAINER_COPY_AND_ASSIGN_AUTO( PC, base_type, this_type )   \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE'
  840 |    BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
      |    ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS'
  843 |     BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type )  \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS'
   64 |         BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:775:10: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  775 |     std::auto_ptr<this_type> release()              \
      |          ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:810:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_RELEASE_AND_CLONE'
  810 |     BOOST_PTR_CONTAINER_RELEASE_AND_CLONE( this_type )                     \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE'
  840 |    BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
      |    ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS'
  843 |     BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type )  \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS'
   64 |         BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:782:10: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  782 |     std::auto_ptr<this_type> clone() const          \
      |          ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:810:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_RELEASE_AND_CLONE'
  810 |     BOOST_PTR_CONTAINER_RELEASE_AND_CLONE( this_type )                     \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE'
  840 |    BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
      |    ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS'
  843 |     BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type )  \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS'
   64 |         BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_vector.hpp: In member function 'std::auto_ptr<boost::ptr_vector<T, CloneAllocator, Allocator> > boost::ptr_vector<T, CloneAllocator, Allocator>::release()':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:777:12: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  777 |       std::auto_ptr<this_type> ptr( new this_type );\
      |            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:810:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_RELEASE_AND_CLONE'
  810 |     BOOST_PTR_CONTAINER_RELEASE_AND_CLONE( this_type )                     \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE'
  840 |    BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
      |    ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS'
  843 |     BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type )  \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS'
   64 |         BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_vector.hpp: In member function 'std::auto_ptr<boost::ptr_vector<T, CloneAllocator, Allocator> > boost::ptr_vector<T, CloneAllocator, Allocator>::clone() const':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:784:20: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  784 |        return std::auto_ptr<this_type>( new this_type( this->begin(), this->end() ) ); \
      |                    ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:810:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_RELEASE_AND_CLONE'
  810 |     BOOST_PTR_CONTAINER_RELEASE_AND_CLONE( this_type )                     \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE'
  840 |    BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
      |    ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS'
  843 |     BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type )  \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS'
   64 |         BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/SparseCore:37,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Sparse:26,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:31,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_mesh_domain_3.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:20:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In function 'std::ostream& Eigen::operator<<(std::ostream&, const SparseMatrixBase<Derived>&)':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:232: note: '-Wmisleading-indentation' is disabled from this point onwards, since column-tracking was disabled due to the size of the code/headers
  232 |             for ( ; col<it.index(); ++col)
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:232: note: adding '-flarge-source-files' will allow for more column-tracking support, at the expense of compilation time and memory
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::SparseMatrix<double, 0, int> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:0:   required from 'class Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 0, int> >'
   36 | class SparseCompressedBase
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:0:   required from 'class Eigen::SparseMatrix<double, 0, int>'
   96 | class SparseMatrix
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:293:0:   required from 'struct CGAL::Eigen_sparse_matrix<double>'
  293 |   mutable EigenType m_matrix;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:99:0:   required from here
   99 | template<class EigenSolverT = Eigen::BiCGSTAB<Eigen_sparse_matrix<double>::EigenType> >
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:0:   required from 'class Eigen::SparseCompressedBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >'
   36 | class SparseCompressedBase
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMap.h:50:0:   required from 'class Eigen::SparseMapBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 0>'
   50 | class SparseMapBase<Derived,ReadOnlyAccessors>
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:83:0:   required from 'class Eigen::internal::SparseRefBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >'
   83 | template<typename Derived> class SparseRefBase
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:177:0:   required from 'class Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >'
  177 | class Ref<const SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType>
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:37:0:   required from 'struct Eigen::internal::is_ref_compatible_impl<Eigen::SparseMatrix<double, 0, int> >'
   37 |   enum { value = sizeof(test<MatrixType>(ms_from, 0))==sizeof(yes) };
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:43:0:   required from 'struct Eigen::internal::is_ref_compatible<Eigen::SparseMatrix<double, 0, int> >'
   43 |   enum { value = is_ref_compatible_impl<typename remove_all<MatrixType>::type>::value };
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:46:0:   required from 'class Eigen::IterativeSolverBase<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> > >'
   46 | template<typename MatrixType, bool MatrixFree = !internal::is_ref_compatible<MatrixType>::value>
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:158:0:   required from 'class Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >'
  158 | class BiCGSTAB : public IterativeSolverBase<BiCGSTAB<_MatrixType,_Preconditioner> >
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:239:0:   required from here
  239 |   typedef EigenSolverT::Scalar                                          Scalar;
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, -1>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, -1, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h:41:0:   required from 'class Eigen::DiagonalPreconditioner<double>'
   41 |     typedef typename Vector::StorageIndex StorageIndex;
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:431:0:   required from 'class Eigen::IterativeSolverBase<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> > >'
  431 |   Preconditioner m_preconditioner;
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:158:0:   required from 'class Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >'
  158 | class BiCGSTAB : public IterativeSolverBase<BiCGSTAB<_MatrixType,_Preconditioner> >
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:239:0:   required from here
  239 |   typedef EigenSolverT::Scalar                                          Scalar;
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, -1, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h:41:0:   required from 'class Eigen::DiagonalPreconditioner<double>'
   41 |     typedef typename Vector::StorageIndex StorageIndex;
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:431:0:   required from 'class Eigen::IterativeSolverBase<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> > >'
  431 |   Preconditioner m_preconditioner;
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:158:0:   required from 'class Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >'
  158 | class BiCGSTAB : public IterativeSolverBase<BiCGSTAB<_MatrixType,_Preconditioner> >
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:239:0:   required from here
  239 |   typedef EigenSolverT::Scalar                                          Scalar;
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:41:0:   required from 'class Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >'
   41 | class SolveWithGuess : public internal::generic_xpr_base<SolveWithGuess<Decomposition,RhsType,GuessType>, MatrixXpr, typename internal::traits<RhsType>::StorageKind>::type
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, -1, -1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_matrix.h:39:0:   required from 'struct CGAL::Eigen_matrix<double>'
   39 | struct Eigen_matrix
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 1, -1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:440:19:   required from 'class Eigen::ColPivHouseholderQR<Eigen::Matrix<double, -1, -1> >'
  440 |     RowVectorType m_temp;
      |                   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:246:10:   required from 'struct Eigen::internal::qr_preconditioner_impl<Eigen::Matrix<double, -1, -1>, 2, 0, true>'
  246 |   QRType m_qr;
      |          ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:609:110:   required from 'class Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2>'
  609 |     internal::qr_preconditioner_impl<MatrixType, QRPreconditioner, internal::PreconditionIfMoreColsThanRows> m_qr_precond_morecols;
      |                                                                                                              ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:60:0:   required from here
   60 |     return jacobiSvd.singularValues().array().abs().maxCoeff() /
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:60:0:   required from here
   60 |     return jacobiSvd.singularValues().array().abs().maxCoeff() /
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/scoped_ptr.hpp:13,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/adjacency_list.hpp:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:28,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/selection.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/repair_degeneracies.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/refine_impl.h:28,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/refine.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_faces.h:18,
                 from export_reconstruct.cpp:27:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/scoped_ptr.hpp:63: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   63 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Matrix<double, -1, 1>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:717:21:   required from 'Derived& Eigen::PlainObjectBase<Derived>::setOnes(Eigen::Index) [with Derived = Eigen::Matrix<double, -1, 1>; Eigen::Index = long long int]'
  717 |   return setConstant(Scalar(1));
      |          ~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:276:0:   required from here
  276 |     X.setOnes(B.rows());
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:679:37:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  679 |   RealScalar scale = matrix.cwiseAbs().template maxCoeff<PropagateNaN>();
      |                      ~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28:   required from 'struct Eigen::internal::traits<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, -1, -1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, -1, -1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, -1, -1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:691:29:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  691 |     m_scaledMatrix = matrix / scale;
      |                      ~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, -1, -1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, -1, -1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, -1, -1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, -1, -1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, -1, -1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:691:29:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  691 |     m_scaledMatrix = matrix / scale;
      |                      ~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::Matrix<double, -1, -1>, -1, -1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:697:32:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  697 |     m_workMatrix = matrix.block(0,0,m_diagSize,m_diagSize) / scale;
      |                    ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:697:60:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  697 |     m_workMatrix = matrix.block(0,0,m_diagSize,m_diagSize) / scale;
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:705:61:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  705 |   RealScalar maxDiagEntry = m_workMatrix.cwiseAbs().diagonal().maxCoeff();
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<Eigen::Matrix<double, -1, -1>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<Eigen::Matrix<double, -1, -1>, -1, 1, true, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:758:35:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  758 |       if(computeU()) m_matrixU.col(i) *= m_workMatrix.coeff(i,i)/a;
      |                      ~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_opposite_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:765:62:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  765 |       if(computeU() && (a<RealScalar(0))) m_matrixU.col(i) = -m_matrixU.col(i);
      |                                                              ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<Eigen::Matrix<double, -1, 1>, -1, 1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/VectorBlock.h:56:47:   required from 'class Eigen::VectorBlock<Eigen::Matrix<double, -1, 1>, -1>'
   56 | template<typename VectorType, int Size> class VectorBlock
      |                                               ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:777:65:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  777 |     RealScalar maxRemainingSingularValue = m_singularValues.tail(m_diagSize-i).maxCoeff(&pos);
      |                                            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/assert.hpp:35,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:0:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:31,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:20:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:0:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/int.hpp:20,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda_fwd.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_spec.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/or.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/type_traits.h:16,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Algebraic_structure_traits.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/number_type_basic.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:28:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176: note: in a call to non-static member function 'boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~VertexListGraphConcept()'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176: note: in expansion of macro 'BOOST_concept'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:0:   required from 'struct boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226: note: in a call to non-static member function 'boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~EdgeListGraphConcept()'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226: note: in expansion of macro 'BOOST_concept'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:0:   required from 'struct boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75: note: in a call to non-static member function 'boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~IncidenceGraphConcept()'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75: note: in expansion of macro 'BOOST_concept'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:960:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::typed_identity_property_map<long long unsigned int>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_complex_3_in_triangulation_3.h:250:55:   required from 'class CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>'
  250 |   typedef typename Edge_map::value_type               Internal_edge;
      |                                                       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:129:9:   required from 'struct boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_complex_3_in_triangulation_3.h:250:55:   required from 'class CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>'
  250 |   typedef typename Edge_map::value_type               Internal_edge;
      |                                                       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >::~AssignableConcept()'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept'
  143 |   BOOST_concept(Assignable,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_complex_3_in_triangulation_3.h:250:55:   required from 'class CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>'
  250 |   typedef typename Edge_map::value_type               Internal_edge;
      |                                                       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:132:9:   required from 'struct boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_complex_3_in_triangulation_3.h:250:55:   required from 'class CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>'
  250 |   typedef typename Edge_map::value_type               Internal_edge;
      |                                                       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >::~BinaryFunctionConcept()'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Matrix<double, -1, -1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:228:33:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  228 |       m_adjoint = matrix.adjoint();
      |                   ~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:175:44:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:345:58:   required from 'class Eigen::TriangularViewImpl<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 1, Eigen::Dense>'
  345 | template<typename _MatrixType, unsigned int _Mode> class TriangularViewImpl<_MatrixType,_Mode,Dense>
      |                                                          ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:187:58:   required from 'class Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 1>'
  187 | template<typename _MatrixType, unsigned int _Mode> class TriangularView
      |                                                          ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:231:121:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  231 |       svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint();
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 2>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 2>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 2, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 2, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 2, 2> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 2, 2>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/misc/RealSvd2x2.h:25:26:   required from 'void Eigen::internal::real_2x2_jacobi_svd(const MatrixType&, Index, Index, Eigen::JacobiRotation<RealScalar>*, Eigen::JacobiRotation<RealScalar>*) [with MatrixType = Eigen::Matrix<double, -1, -1>; RealScalar = double; Index = long long int]'
   25 |   Matrix<RealScalar,2,2> m;
      |                          ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:730:42:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  730 |             internal::real_2x2_jacobi_svd(m_workMatrix, p, q, &j_left, &j_right);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<Eigen::Matrix<double, -1, -1>, 1, -1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:297:10:   required from 'void Eigen::MatrixBase<Derived>::applyOnTheLeft(Eigen::Index, Eigen::Index, const Eigen::JacobiRotation<OtherScalar>&) [with OtherScalar = double; Derived = Eigen::Matrix<double, -1, -1>; Eigen::Index = long long int]'
  297 |   RowXpr x(this->row(p));
      |          ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:733:40:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  733 |             m_workMatrix.applyOnTheLeft(p,q,j_left);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:0:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   66 |     BOOST_CONCEPT_USAGE(Graph)
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:0:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  182 |     BOOST_CONCEPT_USAGE(VertexListGraph)
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:0:   required from 'struct boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:0:   required from 'struct boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:148:7:   required from 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:208:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:148:7:   required from 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::typed_identity_property_map<long long unsigned int>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_complex_3_in_triangulation_3.h:250:55:   required from 'class CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>'
  250 |   typedef typename Edge_map::value_type               Internal_edge;
      |                                                       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_complex_3_in_triangulation_3.h:250:55:   required from 'class CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>'
  250 |   typedef typename Edge_map::value_type               Internal_edge;
      |                                                       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >; Return = bool; First = CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>; Second = CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  351 |       BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::SparseMatrix<double, 1, int> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:0:   required from 'class Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 1, int> >'
   36 | class SparseCompressedBase
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:0:   required from 'class Eigen::SparseMatrix<double, 1, int>'
   96 | class SparseMatrix
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1040:0:   required from 'void Eigen::internal::set_from_triplets(const InputIterator&, const InputIterator&, SparseMatrixType&, DupFunctor) [with InputIterator = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; SparseMatrixType = Eigen::SparseMatrix<double, 0, int>; DupFunctor = scalar_sum_op<double, double>]'
 1040 |   SparseMatrix<Scalar,IsRowMajor?ColMajor:RowMajor,StorageIndex> trMat(mat.rows(),mat.cols());
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1110:0:   required from 'void Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::setFromTriplets(const InputIterators&, const InputIterators&) [with InputIterators = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1110 |   internal::set_from_triplets<InputIterators, SparseMatrix<Scalar,_Options,_StorageIndex> >(begin, end, *this, internal::scalar_sum_op<Scalar,Scalar>());
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:239:0:   required from 'void CGAL::Eigen_sparse_matrix<T>::assemble_matrix() const [with T = double]'
  239 |     m_matrix.setFromTriplets(m_triplets.begin(), m_triplets.end());
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:249:0:   required from 'const CGAL::Eigen_sparse_matrix<T>::EigenType& CGAL::Eigen_sparse_matrix<T>::eigen_object() const [with T = double; EigenType = Eigen::SparseMatrix<double, 0, int>]'
  249 |       assemble_matrix();
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:271:0:   required from here
  271 |     m_solver_sptr->compute(A.eigen_object());
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:297:21:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  297 |         dst.diagonal().setOnes();
      |         ~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:303:34:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:59:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                                            ~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/VectorBlock.h:56:47:   required from 'class Eigen::VectorBlock<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1>'
   56 | template<typename VectorType, int Size> class VectorBlock
      |                                               ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:310:26:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  310 |           dst.col(k).tail(rows()-k-1).setZero();
      |           ~~~~~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/VectorBlock.h:56:47:   required from 'class Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>'
   56 | template<typename VectorType, int Size> class VectorBlock
      |                                               ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:82:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |                                                                  ~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:297:10:   required from 'void Eigen::MatrixBase<Derived>::applyOnTheLeft(Eigen::Index, Eigen::Index, const Eigen::JacobiRotation<OtherScalar>&) [with OtherScalar = double; Derived = Eigen::Matrix<double, 2, 2>; Eigen::Index = long long int]'
  297 |   RowXpr x(this->row(p));
      |          ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/misc/RealSvd2x2.h:46:19:   required from 'void Eigen::internal::real_2x2_jacobi_svd(const MatrixType&, Index, Index, Eigen::JacobiRotation<RealScalar>*, Eigen::JacobiRotation<RealScalar>*) [with MatrixType = Eigen::Matrix<double, -1, -1>; RealScalar = double; Index = long long int]'
   46 |   m.applyOnTheLeft(0,1,rot1);
      |   ~~~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:730:42:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  730 |             internal::real_2x2_jacobi_svd(m_workMatrix, p, q, &j_left, &j_right);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 2>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>, 1>'
  223 | template<typename Derived> class MapBase<Derived, WriteAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:297:10:   required from 'void Eigen::MatrixBase<Derived>::applyOnTheLeft(Eigen::Index, Eigen::Index, const Eigen::JacobiRotation<OtherScalar>&) [with OtherScalar = double; Derived = Eigen::Matrix<double, 2, 2>; Eigen::Index = long long int]'
  297 |   RowXpr x(this->row(p));
      |          ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/misc/RealSvd2x2.h:46:19:   required from 'void Eigen::internal::real_2x2_jacobi_svd(const MatrixType&, Index, Index, Eigen::JacobiRotation<RealScalar>*, Eigen::JacobiRotation<RealScalar>*) [with MatrixType = Eigen::Matrix<double, -1, -1>; RealScalar = double; Index = long long int]'
   46 |   m.applyOnTheLeft(0,1,rot1);
      |   ~~~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:730:42:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  730 |             internal::real_2x2_jacobi_svd(m_workMatrix, p, q, &j_left, &j_right);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:277:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:475:5:   required from 'void Eigen::internal::apply_rotation_in_the_plane(Eigen::DenseBase<Derived>&, Eigen::DenseBase<Derived>&, const Eigen::JacobiRotation<OtherScalar>&) [with VectorX = Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>; VectorY = Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>; OtherScalar = double]'
  475 |     EIGEN_PLAIN_ENUM_MIN(evaluator<VectorX>::Alignment, evaluator<VectorY>::Alignment),
      |                                              ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:299:40:   required from 'void Eigen::MatrixBase<Derived>::applyOnTheLeft(Eigen::Index, Eigen::Index, const Eigen::JacobiRotation<OtherScalar>&) [with OtherScalar = double; Derived = Eigen::Matrix<double, -1, -1>; Eigen::Index = long long int]'
  299 |   internal::apply_rotation_in_the_plane(x, y, j);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:733:40:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  733 |             m_workMatrix.applyOnTheLeft(p,q,j_left);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:475:5:   required from 'void Eigen::internal::apply_rotation_in_the_plane(Eigen::DenseBase<Derived>&, Eigen::DenseBase<Derived>&, const Eigen::JacobiRotation<OtherScalar>&) [with VectorX = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>; VectorY = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>; OtherScalar = double]'
  475 |     EIGEN_PLAIN_ENUM_MIN(evaluator<VectorX>::Alignment, evaluator<VectorY>::Alignment),
      |                                              ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:315:40:   required from 'void Eigen::MatrixBase<Derived>::applyOnTheRight(Eigen::Index, Eigen::Index, const Eigen::JacobiRotation<OtherScalar>&) [with OtherScalar = double; Derived = Eigen::Matrix<double, -1, -1>; Eigen::Index = long long int]'
  315 |   internal::apply_rotation_in_the_plane(x, y, j.transpose());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:734:53:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  734 |             if(computeU()) m_matrixU.applyOnTheRight(p,q,j_left.transpose());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:0:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:0:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176: note: in a call to non-static member function 'boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~VertexListGraphConcept()'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176: note: in expansion of macro 'BOOST_concept'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:0:   required from 'struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226: note: in a call to non-static member function 'boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~EdgeListGraphConcept()'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226: note: in expansion of macro 'BOOST_concept'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:0:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75: note: in a call to non-static member function 'boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~IncidenceGraphConcept()'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75: note: in expansion of macro 'BOOST_concept'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, void*>, const boost::detail::edge_desc_impl<boost::directed_tag, void*>&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_reverse_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:960:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, void*>, const boost::detail::edge_desc_impl<boost::directed_tag, void*>&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_reverse_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, boost::vertex_index_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, boost::vertex_index_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:0:   required from 'struct boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:0:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:0:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:180:7:   required from 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function 'boost::RandomAccessIteratorConcept<std::_Bit_iterator>::~RandomAccessIteratorConcept()'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro 'BOOST_concept'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function 'boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >::~RandomAccessIteratorConcept()'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro 'BOOST_concept'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::SparseMatrix<double, 1, int>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:0:   required from 'struct Eigen::internal::evaluator<Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 1, int> > >'
  336 |   typedef typename DenseCoeffsBase<Derived,ReadOnlyAccessors>::CoeffReturnType CoeffReturnType;
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:0:   required from 'struct Eigen::internal::evaluator<Eigen::SparseMatrix<double, 1, int> >'
 1505 | struct evaluator<SparseMatrix<_Scalar,_Options,_StorageIndex> >
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1181:0:   required from 'Eigen::SparseMatrix<_Scalar, _Options, _StorageIndex>& Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::operator=(const Eigen::SparseMatrixBase<OtherDerived>&) [with OtherDerived = Eigen::SparseMatrix<double, 1, int>; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1181 |   const bool needToTranspose = (Flags & RowMajorBit) != (internal::evaluator<OtherDerived>::Flags & RowMajorBit);
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1063:0:   required from 'void Eigen::internal::set_from_triplets(const InputIterator&, const InputIterator&, SparseMatrixType&, DupFunctor) [with InputIterator = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; SparseMatrixType = Eigen::SparseMatrix<double, 0, int>; DupFunctor = scalar_sum_op<double, double>]'
 1063 |   mat = trMat;
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1110:0:   required from 'void Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::setFromTriplets(const InputIterators&, const InputIterators&) [with InputIterators = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1110 |   internal::set_from_triplets<InputIterators, SparseMatrix<Scalar,_Options,_StorageIndex> >(begin, end, *this, internal::scalar_sum_op<Scalar,Scalar>());
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:239:0:   required from 'void CGAL::Eigen_sparse_matrix<T>::assemble_matrix() const [with T = double]'
  239 |     m_matrix.setFromTriplets(m_triplets.begin(), m_triplets.end());
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:249:0:   required from 'const CGAL::Eigen_sparse_matrix<T>::EigenType& CGAL::Eigen_sparse_matrix<T>::eigen_object() const [with T = double; EigenType = Eigen::SparseMatrix<double, 0, int>]'
  249 |       assemble_matrix();
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:271:0:   required from here
  271 |     m_solver_sptr->compute(A.eigen_object());
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 1, -1>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:521:73:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  521 |     RealScalar biggest_col_sq_norm = numext::abs2(m_colNormsUpdated.tail(cols-k).maxCoeff(&biggest_col_index));
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:165:63:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  165 |     Map<typename internal::plain_col_type<PlainObject>::type> tmp(workspace,rows());
      |                                                               ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:166:82:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  166 |     Block<Derived, Derived::RowsAtCompileTime, EssentialPart::SizeAtCompileTime> right(derived(), 0, 1, rows(), cols()-1);
      |                                                                                  ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:27:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |                     ~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:168:21:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  168 |     tmp += this->col(0);
      |            ~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:169:25:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  169 |     this->col(0) -= tau * tmp;
      |                     ~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:169:25:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  169 |     this->col(0) -= tau * tmp;
      |                     ~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:53:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  170 |     right.noalias() -= tau * tmp * essential.adjoint();
      |                                    ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<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>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<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>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<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>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<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>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 0, 5>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<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>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<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>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:34:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  170 |     right.noalias() -= tau * tmp * essential.adjoint();
      |                        ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:127:63:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  127 |     Map<typename internal::plain_row_type<PlainObject>::type> tmp(workspace,cols());
      |                                                               ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:41:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |                     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:130:21:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  130 |     tmp += this->row(0);
      |            ~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:131:25:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  131 |     this->row(0) -= tau * tmp;
      |                     ~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 0, Eigen::Stride<0, 0> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:131:25:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  131 |     this->row(0) -= tau * tmp;
      |                     ~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:132:29:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  132 |     bottom.noalias() -= tau * essential * tmp;
      |                         ~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<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::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<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::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<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::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<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::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0, 5>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<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::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<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::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:132:41:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  132 |     bottom.noalias() -= tau * essential * tmp;
      |                         ~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:90:75:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   90 |   Matrix<typename MatrixType::Scalar, TFactorSize, TFactorSize, RowMajor> T(nbVecs,nbVecs);
      |                                                                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:175:44:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:93:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                                    ~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 0, 8>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:96:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                                    ~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1>, 0, 8>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:101:66:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  101 |   if(forward) tmp = T.template triangularView<Upper>()           * tmp;
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:175:44:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:102:63:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  102 |   else        tmp = T.template triangularView<Upper>().adjoint() * tmp;
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1>, 0, 8>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:102:66:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  102 |   else        tmp = T.template triangularView<Upper>().adjoint() * tmp;
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, 0, 8>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:22:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |                    ~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, -1, -1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, -1, -1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, -1, -1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, -1, -1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:846:33:   required from 'static Derived& Eigen::internal::setIdentity_impl<Derived, Big>::run(Derived&) [with Derived = Eigen::Matrix<double, -1, -1>; bool Big = false]'
  846 |     return m = Derived::Identity(m.rows(), m.cols());
      |                ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:875:50:   required from 'Derived& Eigen::MatrixBase<Derived>::setIdentity() [with Derived = Eigen::Matrix<double, -1, -1>]'
  875 |   return internal::setIdentity_impl<Derived>::run(derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:892:21:   required from 'Derived& Eigen::MatrixBase<Derived>::setIdentity(Eigen::Index, Eigen::Index) [with Derived = Eigen::Matrix<double, -1, -1>; Eigen::Index = long long int]'
  892 |   return setIdentity();
      |          ~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:698:45:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  698 |     if(m_computeFullU) m_matrixU.setIdentity(m_rows,m_rows);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:475:5:   required from 'void Eigen::internal::apply_rotation_in_the_plane(Eigen::DenseBase<Derived>&, Eigen::DenseBase<Derived>&, const Eigen::JacobiRotation<OtherScalar>&) [with VectorX = Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>; VectorY = Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>; OtherScalar = double]'
  475 |     EIGEN_PLAIN_ENUM_MIN(evaluator<VectorX>::Alignment, evaluator<VectorY>::Alignment),
      |                                              ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:299:40:   required from 'void Eigen::MatrixBase<Derived>::applyOnTheLeft(Eigen::Index, Eigen::Index, const Eigen::JacobiRotation<OtherScalar>&) [with OtherScalar = double; Derived = Eigen::Matrix<double, 2, 2>; Eigen::Index = long long int]'
  299 |   internal::apply_rotation_in_the_plane(x, y, j);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/misc/RealSvd2x2.h:46:19:   required from 'void Eigen::internal::real_2x2_jacobi_svd(const MatrixType&, Index, Index, Eigen::JacobiRotation<RealScalar>*, Eigen::JacobiRotation<RealScalar>*) [with MatrixType = Eigen::Matrix<double, -1, -1>; RealScalar = double; Index = long long int]'
   46 |   m.applyOnTheLeft(0,1,rot1);
      |   ~~~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:730:42:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  730 |             internal::real_2x2_jacobi_svd(m_workMatrix, p, q, &j_left, &j_right);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:79:51:   required from 'class Eigen::internal::visitor_evaluator<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false> >'
   79 |     CoeffReadCost = internal::evaluator<XprType>::CoeffReadCost
      |                                                   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>; Derived = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>]'
  123 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:374:14:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff(IndexType*) const [with int NaNPropagation = 0; IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  374 |   this->visit(maxVisitor);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:501:37:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff(IndexType*) const [with IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  501 |       return maxCoeff<PropagateFast>(index);
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:777:88:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  777 |     RealScalar maxRemainingSingularValue = m_singularValues.tail(m_diagSize-i).maxCoeff(&pos);
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >; Func = Eigen::internal::scalar_max_op<double, double, 0>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_max_op<double, double, 0>; Derived = Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:448:25:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff() const [with int NaNPropagation = 0; Derived = Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >; typename Eigen::internal::traits<T>::Scalar = double]'
  448 |   return derived().redux(Eigen::internal::scalar_max_op<Scalar,Scalar, NaNPropagation>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:466:37:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff() const [with Derived = Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >; typename Eigen::internal::traits<T>::Scalar = double]'
  466 |       return maxCoeff<PropagateFast>();
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:60:0:   required from here
   60 |     return jacobiSvd.singularValues().array().abs().maxCoeff() /
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:0:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   66 |     BOOST_CONCEPT_USAGE(Graph)
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:0:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  182 |     BOOST_CONCEPT_USAGE(VertexListGraph)
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:0:   required from 'struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:0:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:0:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:0:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:0:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:0:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:0:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:0:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:0:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:0:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:0:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:0:   required from 'struct boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:0:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:0:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Comparable<TT>::~Comparable() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:127:16:   required from 'struct boost::range_detail::IncrementableIteratorConcept<long long unsigned int*>'
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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> >]':
D:/RCompile/CRANpkg/lib/4.7/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>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/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)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/iterator/iterator_concepts.hpp:106:7:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/iterator/iterator_concepts.hpp:106:7:   required from 'struct boost::range_detail::IncrementableIteratorConcept<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13:   required from 'struct boost::range_detail::IncrementableIteratorConcept<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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> >]':
D:/RCompile/CRANpkg/lib/4.7/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>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/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)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:154:13:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:154:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:280:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:280:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:280:9:   required from 'struct boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:127:16:   required from 'struct boost::range_detail::IncrementableIteratorConcept<const long long unsigned int*>'
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13:   required from 'struct boost::range_detail::IncrementableIteratorConcept<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:283:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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<const long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:283:9:   required from 'struct boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 = const long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:286:9:   required from 'struct boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = std::array<long long unsigned int, 3>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:286:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  286 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1> >; Func = Eigen::internal::scalar_max_op<double, double, 1>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_max_op<double, double, 1>; Derived = Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:448:25:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff() const [with int NaNPropagation = 1; Derived = Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  448 |   return derived().redux(Eigen::internal::scalar_max_op<Scalar,Scalar, NaNPropagation>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:679:71:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  679 |   RealScalar scale = matrix.cwiseAbs().template maxCoeff<PropagateNaN>();
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:540:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  540 |     m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:132:29:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  132 |     bottom.noalias() -= tau * essential * tmp;
      |                         ~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0, 5>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<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::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:406:42:   required from 'Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::TriangularViewType& Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::setConstant(const Scalar&) [with _MatrixType = Eigen::Matrix<double, -1, -1>; unsigned int _Mode = 10; TriangularViewType = Eigen::TriangularView<Eigen::Matrix<double, -1, -1>, 10>; Scalar = double]'
  406 |     { return *this = MatrixType::Constant(derived().rows(), derived().cols(), value); }
      |                      ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:409:44:   required from 'Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::TriangularViewType& Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::setZero() [with _MatrixType = Eigen::Matrix<double, -1, -1>; unsigned int _Mode = 10; TriangularViewType = Eigen::TriangularView<Eigen::Matrix<double, -1, -1>, 10>]'
  409 |     TriangularViewType& setZero() { return setConstant(Scalar(0)); }
      |                                            ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:298:61:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  298 |         dst.template triangularView<StrictlyUpper>().setZero();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:63:57:   required from 'void Eigen::internal::make_block_householder_triangular_factor(TriangularFactorType&, const VectorsType&, const CoeffsType&) [with TriangularFactorType = Eigen::Matrix<double, -1, -1, 1, -1, -1>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   63 |       triFactor.row(i).tail(rt).noalias() = -hCoeffs(i) * vectors.col(i).tail(rs).adjoint()
      |                                             ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 5>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 5>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 5>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 5>, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 5>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:73:50:   required from 'void Eigen::internal::make_block_householder_triangular_factor(TriangularFactorType&, const VectorsType&, const CoeffsType&) [with TriangularFactorType = Eigen::Matrix<double, -1, -1, 1, -1, -1>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   73 |           triFactor.row(i).tail(nbVecs-j-1) += z * triFactor.row(j).tail(nbVecs-j-1);
      |                                                ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:0:   required from 'struct boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:0:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:0:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:603:11:   required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:603:11:   required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 9>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 3, 3> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 3, 3>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:146:17:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  146 |     EigenMatrix m = construct_covariance_matrix(cov);
      |                 ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 3, 3> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 3, 3> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 3>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 3, 1> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 3, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:149:17:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  149 |     EigenVector eigenvalues_;
      |                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 3, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 3, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 2, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 2, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 2, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1> >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:154:0:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::linear_solver(const Matrix&, const Vector&, Vector&, NT&) [with EigenSolverT = Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> >; Matrix = CGAL::Eigen_sparse_symmetric_matrix<double>; Vector = CGAL::Eigen_vector<double>; NT = double]'
  154 |     X = m_solver_sptr->solve(B);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:835:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::solve_poisson(SparseLinearAlgebraTraits_d, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  835 |     if(!solver.linear_solver(A, B, X, D))
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:545:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  545 |     if ( ! solve_poisson(solver, lambda) )
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:127:16:   required from 'struct boost::range_detail::IncrementableIteratorConcept<long long unsigned int*>'
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible<TT>::~CopyConstructible() [with TT = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13:   required from 'struct boost::range_detail::IncrementableIteratorConcept<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  138 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<const long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<const long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:127:16:   required from 'struct boost::range_detail::IncrementableIteratorConcept<const long long unsigned int*>'
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible<TT>::~CopyConstructible() [with TT = const long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<const long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<const long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13:   required from 'struct boost::range_detail::IncrementableIteratorConcept<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 = const long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  138 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<const long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<const long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = const long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<const long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 = const long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:286:9:   required from 'struct boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:145:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  145 |     CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, output_mesh);
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = std::array<long long unsigned int, 3>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:286:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  286 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:507:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  507 |     m_colNormsDirect.coeffRef(k) = m_qr.col(k).norm();
      |                                    ~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:540:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  540 |     m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:93:22:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:540:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  540 |     m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_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
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:567:77:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  567 |           m_colNormsDirect.coeffRef(j) = m_qr.col(j).tail(rows - k - 1).norm();
      |                                          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, -1, -1>, -1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/SVDBase.h:315:54:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, Eigen::Matrix<double, -1, 1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, Eigen::Matrix<double, -1, 1>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, Eigen::Matrix<double, -1, 1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, Eigen::Matrix<double, -1, 1>, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, Eigen::Matrix<double, -1, 1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, Eigen::Matrix<double, -1, 1>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/SVDBase.h:315:57:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DiagonalMatrix.h:278:47:   required from 'struct Eigen::internal::traits<Eigen::DiagonalWrapper<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> > > >'
  278 |   typedef typename DiagonalVectorType::Scalar Scalar;
      |                                               ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/EigenBase.h:42:59:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::DiagonalWrapper<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> > >, Eigen::Matrix<double, -1, 1>, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::DiagonalWrapper<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> > >, Eigen::Matrix<double, -1, 1>, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::DiagonalWrapper<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> > >, Eigen::Matrix<double, -1, 1>, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::DiagonalWrapper<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> > >, Eigen::Matrix<double, -1, 1>, 1, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::DiagonalWrapper<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> > >, Eigen::Matrix<double, -1, 1>, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::DiagonalWrapper<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<double>, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false> > >, Eigen::Matrix<double, -1, 1>, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/SVDBase.h:316:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, Eigen::Matrix<double, -1, 1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, Eigen::Matrix<double, -1, 1>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, Eigen::Matrix<double, -1, 1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, Eigen::Matrix<double, -1, 1>, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, Eigen::Matrix<double, -1, 1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, Eigen::Matrix<double, -1, 1>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/SVDBase.h:317:36:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:0:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<void*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:0:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:0:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:0:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<void*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:0:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:0:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:0:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<void*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:0:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:0:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:0:   required from 'struct boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:0:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:0:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long long int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:514:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:109:22: note: in a call to non-static member function 'boost::SignedInteger<long long int>::~SignedInteger()'
  109 |   template <> struct SignedInteger< ::boost::long_long_type> {};
      |                      ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:545:11:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:545:11:   required from 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:573:11:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:573:11:   required from 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:603:11:   required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:92:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 3, 3> >'
   92 |             >::type DiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:97:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 3, 3> >'
   97 |             >::type SubDiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, 0>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:92:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 2, 2> >'
   92 |             >::type DiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:97:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 2, 2> >'
   97 |             >::type SubDiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 2, 2>, -1>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:97:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 2, 2> >'
   97 |             >::type SubDiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   required from 'class Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 2, 2> >'
  111 |     typedef typename TridiagonalizationType::SubDiagonalType SubDiagonalType;
      |                                                              ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:97:48:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, 1, 0, 1, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:769:0:   required from 'unsigned int CGAL::Poisson_reconstruction_function<Gt>::delaunay_refinement(FT, Sizing_field, unsigned int, FT, Second_sizing_field) [with Sizing_field = CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >; Second_sizing_field = CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >; Gt = CGAL::Epick; FT = double]'
  769 |     unsigned int nb_vertices_added = poisson_refine_triangulation(*m_tr,radius_edge_ratio_bound,sizing_field,second_sizing_field,max_vertices,elarged_bsphere);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:516:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  516 |       NB.push_back( delaunay_refinement(radius_edge_ratio_bound,
  517 |                                         sizing_field2,
  518 |                                         max_vertices,
  519 |                                         enlarge_ratio,
  520 |                                         sizing_field_ok) );
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:129:9:   required from 'struct boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:0:   required from 'class CGAL::Double_map<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Meshes/Double_map_container.h:38:0:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:769:0:   required from 'unsigned int CGAL::Poisson_reconstruction_function<Gt>::delaunay_refinement(FT, Sizing_field, unsigned int, FT, Second_sizing_field) [with Sizing_field = CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >; Second_sizing_field = CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >; Gt = CGAL::Epick; FT = double]'
  769 |     unsigned int nb_vertices_added = poisson_refine_triangulation(*m_tr,radius_edge_ratio_bound,sizing_field,second_sizing_field,max_vertices,elarged_bsphere);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:516:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  516 |       NB.push_back( delaunay_refinement(radius_edge_ratio_bound,
  517 |                                         sizing_field2,
  518 |                                         max_vertices,
  519 |                                         enlarge_ratio,
  520 |                                         sizing_field_ok) );
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >::~AssignableConcept()'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept'
  143 |   BOOST_concept(Assignable,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:769:0:   required from 'unsigned int CGAL::Poisson_reconstruction_function<Gt>::delaunay_refinement(FT, Sizing_field, unsigned int, FT, Second_sizing_field) [with Sizing_field = CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >; Second_sizing_field = CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >; Gt = CGAL::Epick; FT = double]'
  769 |     unsigned int nb_vertices_added = poisson_refine_triangulation(*m_tr,radius_edge_ratio_bound,sizing_field,second_sizing_field,max_vertices,elarged_bsphere);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:516:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  516 |       NB.push_back( delaunay_refinement(radius_edge_ratio_bound,
  517 |                                         sizing_field2,
  518 |                                         max_vertices,
  519 |                                         enlarge_ratio,
  520 |                                         sizing_field_ok) );
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:132:9:   required from 'struct boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:0:   required from 'class CGAL::Double_map<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Meshes/Double_map_container.h:38:0:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:769:0:   required from 'unsigned int CGAL::Poisson_reconstruction_function<Gt>::delaunay_refinement(FT, Sizing_field, unsigned int, FT, Second_sizing_field) [with Sizing_field = CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >; Second_sizing_field = CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >; Gt = CGAL::Epick; FT = double]'
  769 |     unsigned int nb_vertices_added = poisson_refine_triangulation(*m_tr,radius_edge_ratio_bound,sizing_field,second_sizing_field,max_vertices,elarged_bsphere);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:516:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  516 |       NB.push_back( delaunay_refinement(radius_edge_ratio_bound,
  517 |                                         sizing_field2,
  518 |                                         max_vertices,
  519 |                                         enlarge_ratio,
  520 |                                         sizing_field_ok) );
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >::~BinaryFunctionConcept()'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:769:0:   required from 'unsigned int CGAL::Poisson_reconstruction_function<Gt>::delaunay_refinement(FT, Sizing_field, unsigned int, FT, Second_sizing_field) [with Sizing_field = CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >; Second_sizing_field = CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >; Gt = CGAL::Epick; FT = double]'
  769 |     unsigned int nb_vertices_added = poisson_refine_triangulation(*m_tr,radius_edge_ratio_bound,sizing_field,second_sizing_field,max_vertices,elarged_bsphere);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:516:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  516 |       NB.push_back( delaunay_refinement(radius_edge_ratio_bound,
  517 |                                         sizing_field2,
  518 |                                         max_vertices,
  519 |                                         enlarge_ratio,
  520 |                                         sizing_field_ok) );
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:129:9:   required from 'struct boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:0:   required from 'class CGAL::Double_map<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Meshes/Double_map_container.h:38:0:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:769:0:   required from 'unsigned int CGAL::Poisson_reconstruction_function<Gt>::delaunay_refinement(FT, Sizing_field, unsigned int, FT, Second_sizing_field) [with Sizing_field = CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >; Second_sizing_field = CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >; Gt = CGAL::Epick; FT = double]'
  769 |     unsigned int nb_vertices_added = poisson_refine_triangulation(*m_tr,radius_edge_ratio_bound,sizing_field,second_sizing_field,max_vertices,elarged_bsphere);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:516:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  516 |       NB.push_back( delaunay_refinement(radius_edge_ratio_bound,
  517 |                                         sizing_field2,
  518 |                                         max_vertices,
  519 |                                         enlarge_ratio,
  520 |                                         sizing_field_ok) );
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>::~AssignableConcept()'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept'
  143 |   BOOST_concept(Assignable,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:769:0:   required from 'unsigned int CGAL::Poisson_reconstruction_function<Gt>::delaunay_refinement(FT, Sizing_field, unsigned int, FT, Second_sizing_field) [with Sizing_field = CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >; Second_sizing_field = CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >; Gt = CGAL::Epick; FT = double]'
  769 |     unsigned int nb_vertices_added = poisson_refine_triangulation(*m_tr,radius_edge_ratio_bound,sizing_field,second_sizing_field,max_vertices,elarged_bsphere);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:516:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  516 |       NB.push_back( delaunay_refinement(radius_edge_ratio_bound,
  517 |                                         sizing_field2,
  518 |                                         max_vertices,
  519 |                                         enlarge_ratio,
  520 |                                         sizing_field_ok) );
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:132:9:   required from 'struct boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:0:   required from 'class CGAL::Double_map<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Meshes/Double_map_container.h:38:0:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:769:0:   required from 'unsigned int CGAL::Poisson_reconstruction_function<Gt>::delaunay_refinement(FT, Sizing_field, unsigned int, FT, Second_sizing_field) [with Sizing_field = CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >; Second_sizing_field = CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >; Gt = CGAL::Epick; FT = double]'
  769 |     unsigned int nb_vertices_added = poisson_refine_triangulation(*m_tr,radius_edge_ratio_bound,sizing_field,second_sizing_field,max_vertices,elarged_bsphere);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:516:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  516 |       NB.push_back( delaunay_refinement(radius_edge_ratio_bound,
  517 |                                         sizing_field2,
  518 |                                         max_vertices,
  519 |                                         enlarge_ratio,
  520 |                                         sizing_field_ok) );
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>::~BinaryFunctionConcept()'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:129:9:   required from 'struct boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:0:   required from 'class CGAL::Double_map<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<int, double>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, std::less<std::pair<int, double> > >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Meshes/Double_map_container.h:38:0:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >::~AssignableConcept()'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept'
  143 |   BOOST_concept(Assignable,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:132:9:   required from 'struct boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:0:   required from 'class CGAL::Double_map<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<int, double>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, std::less<std::pair<int, double> > >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Meshes/Double_map_container.h:38:0:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >::~BinaryFunctionConcept()'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<int, double> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::pair<int, double> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<std::pair<int, double> >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<std::pair<int, double> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<std::pair<int, double> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<std::pair<int, double> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<int, double> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<std::pair<int, double> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:129:9:   required from 'struct boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:0:   required from 'class CGAL::Double_map<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<int, double>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, std::less<std::pair<int, double> > >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Meshes/Double_map_container.h:38:0:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<std::pair<int, double> >::~AssignableConcept()'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept'
  143 |   BOOST_concept(Assignable,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:132:9:   required from 'struct boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:0:   required from 'class CGAL::Double_map<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<int, double>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, std::less<std::pair<int, double> > >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Meshes/Double_map_container.h:38:0:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >::~BinaryFunctionConcept()'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:129:9:   required from 'struct boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, boost::bimaps::multiset_of<int>, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, boost::bimaps::multiset_of<int>, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Refine_facets_manifold_base.h:87:0:   required from 'class CGAL::Mesh_3::Refine_facets_manifold_base<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, CGAL::Mesh_facet_criteria_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, CGAL::Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds> > >, CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>, CGAL::Sequential_tag, CGAL::Meshes::Double_map_container<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<int, double> > >'
   87 |   typedef typename Bad_edges::value_type                         Bad_edge;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Refine_facets_3.h:735:0:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::~AssignableConcept()'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept'
  143 |   BOOST_concept(Assignable,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:132:9:   required from 'struct boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, boost::bimaps::multiset_of<int>, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, boost::bimaps::multiset_of<int>, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Refine_facets_manifold_base.h:87:0:   required from 'class CGAL::Mesh_3::Refine_facets_manifold_base<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, CGAL::Mesh_facet_criteria_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, CGAL::Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds> > >, CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>, CGAL::Sequential_tag, CGAL::Meshes::Double_map_container<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<int, double> > >'
   87 |   typedef typename Bad_edges::value_type                         Bad_edge;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Refine_facets_3.h:735:0:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::~BinaryFunctionConcept()'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<int>'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:129:9:   required from 'struct boost::bimaps::multiset_of<int>::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<int> >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, boost::bimaps::multiset_of<int>, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, boost::bimaps::multiset_of<int>, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Refine_facets_manifold_base.h:87:0:   required from 'class CGAL::Mesh_3::Refine_facets_manifold_base<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, CGAL::Mesh_facet_criteria_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, CGAL::Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds> > >, CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>, CGAL::Sequential_tag, CGAL::Meshes::Double_map_container<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<int, double> > >'
   87 |   typedef typename Bad_edges::value_type                         Bad_edge;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Refine_facets_3.h:735:0:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<int>::~AssignableConcept()'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept'
  143 |   BOOST_concept(Assignable,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<int>, bool, int, int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<int>, bool, int, int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<int>, bool, int, int>'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<int>, bool, int, int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<int>, bool, int, int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<int>, bool, int, int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<int>, bool, int, int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<int>, bool, int, int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:132:9:   required from 'struct boost::bimaps::multiset_of<int>::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<int> >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, boost::bimaps::multiset_of<int>, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, boost::bimaps::multiset_of<int>, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Refine_facets_manifold_base.h:87:0:   required from 'class CGAL::Mesh_3::Refine_facets_manifold_base<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, CGAL::Mesh_facet_criteria_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, CGAL::Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds> > >, CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Mesh_triangulation_3<CGAL::Poisson_mesh_domain_3<CGAL::Epick>, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>, CGAL::Sequential_tag, CGAL::Meshes::Double_map_container<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<int, double> > >'
   87 |   typedef typename Bad_edges::value_type                         Bad_edge;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Refine_facets_3.h:735:0:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<int>, bool, int, int>::~BinaryFunctionConcept()'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:129:9:   required from 'struct boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:0:   required from 'class CGAL::Double_map<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::pair<int, double>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::less<std::pair<int, double> > >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Meshes/Double_map_container.h:38:0:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >::~AssignableConcept()'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept'
  143 |   BOOST_concept(Assignable,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:132:9:   required from 'struct boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:0:   required from 'class CGAL::Double_map<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::pair<int, double>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::less<std::pair<int, double> > >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Meshes/Double_map_container.h:38:0:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >::~BinaryFunctionConcept()'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::SparseMatrix<double, 0, int>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:0:   required from 'struct Eigen::internal::evaluator<Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 0, int> > >'
  336 |   typedef typename DenseCoeffsBase<Derived,ReadOnlyAccessors>::CoeffReturnType CoeffReturnType;
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:0:   required from 'struct Eigen::internal::evaluator<Eigen::SparseMatrix<double, 0, int> >'
 1505 | struct evaluator<SparseMatrix<_Scalar,_Options,_StorageIndex> >
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:79:0:   required from 'void Eigen::internal::assign_sparse_to_sparse(DstXprType&, const SrcXprType&) [with DstXprType = Eigen::SparseMatrix<double, 0, int>; SrcXprType = Eigen::SparseMatrix<double, 1, int>]'
   79 |   const bool transpose = (DstEvaluatorType::Flags & RowMajorBit) != (SrcEvaluatorType::Flags & RowMajorBit);
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:132:0:   required from 'static void Eigen::internal::Assignment<DstXprType, SrcXprType, Functor, Eigen::internal::Sparse2Sparse>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<typename DstXprType::Scalar, typename SrcXprType::Scalar>&) [with DstXprType = Eigen::SparseMatrix<double, 0, int>; SrcXprType = Eigen::SparseMatrix<double, 1, int>; Functor = Eigen::internal::assign_op<double, double>; typename DstXprType::Scalar = double; typename SrcXprType::Scalar = double]'
  132 |     assign_sparse_to_sparse(dst.derived(), src.derived());
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:38:0:   required from 'Derived& Eigen::SparseMatrixBase<Derived>::operator=(const Eigen::SparseMatrixBase<OtherDerived>&) [with OtherDerived = Eigen::SparseMatrix<double, 1, int>; Derived = Eigen::SparseMatrix<double, 0, int>]'
   37 |   internal::Assignment<Derived,OtherDerived,internal::assign_op<Scalar,typename OtherDerived::Scalar> >
   38 |           ::run(derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1239:0:   required from 'Eigen::SparseMatrix<_Scalar, _Options, _StorageIndex>& Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::operator=(const Eigen::SparseMatrixBase<OtherDerived>&) [with OtherDerived = Eigen::SparseMatrix<double, 1, int>; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1239 |     return Base::operator=(other.derived());
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1063:0:   required from 'void Eigen::internal::set_from_triplets(const InputIterator&, const InputIterator&, SparseMatrixType&, DupFunctor) [with InputIterator = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; SparseMatrixType = Eigen::SparseMatrix<double, 0, int>; DupFunctor = scalar_sum_op<double, double>]'
 1063 |   mat = trMat;
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1110:0:   required from 'void Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::setFromTriplets(const InputIterators&, const InputIterators&) [with InputIterators = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1110 |   internal::set_from_triplets<InputIterators, SparseMatrix<Scalar,_Options,_StorageIndex> >(begin, end, *this, internal::scalar_sum_op<Scalar,Scalar>());
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:239:0:   required from 'void CGAL::Eigen_sparse_matrix<T>::assemble_matrix() const [with T = double]'
  239 |     m_matrix.setFromTriplets(m_triplets.begin(), m_triplets.end());
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:249:0:   required from 'const CGAL::Eigen_sparse_matrix<T>::EigenType& CGAL::Eigen_sparse_matrix<T>::eigen_object() const [with T = double; EigenType = Eigen::SparseMatrix<double, 0, int>]'
  249 |       assemble_matrix();
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:271:0:   required from here
  271 |     m_solver_sptr->compute(A.eigen_object());
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:42:0:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:0:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:42:0:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   42 |   VectorType r  = rhs - mat * x;
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:0:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:0:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:0:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:0:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:0:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:0:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:0:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:0:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:0:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:0:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:0:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:0:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:0:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:0:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:85:0:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   85 |     y = precond.solve(p);
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:0:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:0:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:100:0:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
  100 |     x += alpha * y + w * z;
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:0:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:0:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 1, -1>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:79:51:   required from 'class Eigen::internal::visitor_evaluator<Eigen::Block<Eigen::Matrix<double, 1, -1>, 1, -1, false> >'
   79 |     CoeffReadCost = internal::evaluator<XprType>::CoeffReadCost
      |                                                   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 1, -1>, 1, -1, false>, 0>; Derived = Eigen::Block<Eigen::Matrix<double, 1, -1>, 1, -1, false>]'
  123 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:374:14:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff(IndexType*) const [with int NaNPropagation = 0; IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 1, -1>, 1, -1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  374 |   this->visit(maxVisitor);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:501:37:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff(IndexType*) const [with IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 1, -1>, 1, -1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  501 |       return maxCoeff<PropagateFast>(index);
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:521:90:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  521 |     RealScalar biggest_col_sq_norm = numext::abs2(m_colNormsUpdated.tail(cols-k).maxCoeff(&biggest_col_index));
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:78:71:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:540:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  540 |     m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:142:7:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::coeff(Eigen::Index) const [with Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>; CoeffReturnType = const double&; Eigen::Index = long long int]'
  142 |       EIGEN_STATIC_ASSERT(internal::evaluator<Derived>::Flags & LinearAccessBit,
      |                                                         ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:79:20:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholder(EssentialPart&, Scalar&, RealScalar&) const [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   79 |   Scalar c0 = coeff(0);
      |               ~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:46:18:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholderInPlace(Scalar&, RealScalar&) [with Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   46 |   makeHouseholder(essentialPart, tau, beta);
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:540:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  540 |     m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Dense>'
  372 |   typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type;
      |                                                                                                      ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:369:45:   required from 'struct Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>'
  369 |   typedef typename nested_eval<Lhs,1>::type LhsNested;
      |                                             ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::Product<Lhs, Rhs, Options>, Eigen::internal::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::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; int Options = 0; Scalar = double; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>]'
  148 |     generic_product_impl<Lhs, Rhs>::evalTo(dst, src.lhs(), src.rhs());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Dense>'
  372 |   typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type;
      |                                                                                                      ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:369:45:   required from 'struct Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>'
  369 |   typedef typename nested_eval<Lhs,1>::type LhsNested;
      |                                             ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::Product<Lhs, Rhs, Options>, Eigen::internal::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::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; int Options = 0; Scalar = double; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>]'
  148 |     generic_product_impl<Lhs, Rhs>::evalTo(dst, src.lhs(), src.rhs());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/NoAlias.h:43:31:   required from 'ExpressionType& Eigen::NoAlias<ExpressionType, StorageBase>::operator=(const StorageBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>; ExpressionType = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; StorageBase = Eigen::MatrixBase]'
   43 |       call_assignment_no_alias(m_expression, other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Block<const 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;
      |                                                                                                      ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:370:45:   required from 'struct Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>'
  370 |   typedef typename nested_eval<Rhs,1>::type RhsNested;
      |                                             ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::Product<Lhs, Rhs, Options>, Eigen::internal::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::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; int Options = 0; Scalar = double; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>]'
  148 |     generic_product_impl<Lhs, Rhs>::evalTo(dst, src.lhs(), src.rhs());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/NoAlias.h:43:31:   required from 'ExpressionType& Eigen::NoAlias<ExpressionType, StorageBase>::operator=(const StorageBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>; ExpressionType = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; StorageBase = Eigen::MatrixBase]'
   43 |       call_assignment_no_alias(m_expression, other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:142:7:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::coeff(Eigen::Index) const [with Derived = Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  142 |       EIGEN_STATIC_ASSERT(internal::evaluator<Derived>::Flags & LinearAccessBit,
      |                                                         ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:182:19:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::operator()(Eigen::Index) const [with Derived = Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  182 |       return coeff(index);
      |              ~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:63:53:   required from 'void Eigen::internal::make_block_householder_triangular_factor(TriangularFactorType&, const VectorsType&, const CoeffsType&) [with TriangularFactorType = Eigen::Matrix<double, -1, -1, 1, -1, -1>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   63 |       triFactor.row(i).tail(rt).noalias() = -hCoeffs(i) * vectors.col(i).tail(rs).adjoint()
      |                                              ~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<std::_List_iterator<void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:0:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
  109 |               m_in_active_list_vec.begin(), m_index_map))
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 3, 3>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 3, 3> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:453:34:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&, int) [with InputType = Eigen::Matrix<double, 3, 3>; _MatrixType = Eigen::Matrix<double, 3, 3>]'
  453 |   RealScalar scale = mat.cwiseAbs().maxCoeff();
      |                      ~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:104:26:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 2, 2>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 2, 2> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:453:34:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&, int) [with InputType = Eigen::Matrix<double, 2, 2>; _MatrixType = Eigen::Matrix<double, 2, 2>]'
  453 |   RealScalar scale = mat.cwiseAbs().maxCoeff();
      |                      ~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:104:26:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:753:0:   required from 'unsigned int CGAL::Poisson_reconstruction_function<Gt>::delaunay_refinement(FT, Sizing_field, unsigned int, FT) [with Sizing_field = CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >; Gt = CGAL::Epick; FT = double]'
  753 |     return delaunay_refinement(radius_edge_ratio_bound,
  754 |                                sizing_field,
  755 |                                max_vertices,
  756 |                                enlarge_ratio,
  757 |                                internal::Poisson::Constant_sizing_field<Triangulation>());
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:450:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  450 |     NB.push_back( delaunay_refinement(radius_edge_ratio_bound,sizing_field,max_vertices,enlarge_ratio));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:129:9:   required from 'struct boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:0:   required from 'class CGAL::Double_map<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Meshes/Double_map_container.h:38:0:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:753:0:   required from 'unsigned int CGAL::Poisson_reconstruction_function<Gt>::delaunay_refinement(FT, Sizing_field, unsigned int, FT) [with Sizing_field = CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >; Gt = CGAL::Epick; FT = double]'
  753 |     return delaunay_refinement(radius_edge_ratio_bound,
  754 |                                sizing_field,
  755 |                                max_vertices,
  756 |                                enlarge_ratio,
  757 |                                internal::Poisson::Constant_sizing_field<Triangulation>());
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:450:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  450 |     NB.push_back( delaunay_refinement(radius_edge_ratio_bound,sizing_field,max_vertices,enlarge_ratio));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>::~AssignableConcept()'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept'
  143 |   BOOST_concept(Assignable,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:753:0:   required from 'unsigned int CGAL::Poisson_reconstruction_function<Gt>::delaunay_refinement(FT, Sizing_field, unsigned int, FT) [with Sizing_field = CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >; Gt = CGAL::Epick; FT = double]'
  753 |     return delaunay_refinement(radius_edge_ratio_bound,
  754 |                                sizing_field,
  755 |                                max_vertices,
  756 |                                enlarge_ratio,
  757 |                                internal::Poisson::Constant_sizing_field<Triangulation>());
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:450:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  450 |     NB.push_back( delaunay_refinement(radius_edge_ratio_bound,sizing_field,max_vertices,enlarge_ratio));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:132:9:   required from 'struct boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:0:   required from 'class CGAL::Double_map<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Meshes/Double_map_container.h:38:0:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:753:0:   required from 'unsigned int CGAL::Poisson_reconstruction_function<Gt>::delaunay_refinement(FT, Sizing_field, unsigned int, FT) [with Sizing_field = CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >; Gt = CGAL::Epick; FT = double]'
  753 |     return delaunay_refinement(radius_edge_ratio_bound,
  754 |                                sizing_field,
  755 |                                max_vertices,
  756 |                                enlarge_ratio,
  757 |                                internal::Poisson::Constant_sizing_field<Triangulation>());
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:450:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  450 |     NB.push_back( delaunay_refinement(radius_edge_ratio_bound,sizing_field,max_vertices,enlarge_ratio));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>::~BinaryFunctionConcept()'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:769:0:   required from 'unsigned int CGAL::Poisson_reconstruction_function<Gt>::delaunay_refinement(FT, Sizing_field, unsigned int, FT, Second_sizing_field) [with Sizing_field = CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >; Second_sizing_field = CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >; Gt = CGAL::Epick; FT = double]'
  769 |     unsigned int nb_vertices_added = poisson_refine_triangulation(*m_tr,radius_edge_ratio_bound,sizing_field,second_sizing_field,max_vertices,elarged_bsphere);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:516:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  516 |       NB.push_back( delaunay_refinement(radius_edge_ratio_bound,
  517 |                                         sizing_field2,
  518 |                                         max_vertices,
  519 |                                         enlarge_ratio,
  520 |                                         sizing_field_ok) );
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:769:0:   required from 'unsigned int CGAL::Poisson_reconstruction_function<Gt>::delaunay_refinement(FT, Sizing_field, unsigned int, FT, Second_sizing_field) [with Sizing_field = CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >; Second_sizing_field = CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >; Gt = CGAL::Epick; FT = double]'
  769 |     unsigned int nb_vertices_added = poisson_refine_triangulation(*m_tr,radius_edge_ratio_bound,sizing_field,second_sizing_field,max_vertices,elarged_bsphere);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:516:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  516 |       NB.push_back( delaunay_refinement(radius_edge_ratio_bound,
  517 |                                         sizing_field2,
  518 |                                         max_vertices,
  519 |                                         enlarge_ratio,
  520 |                                         sizing_field_ok) );
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >; Return = bool; First = CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>; Second = CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  351 |       BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:769:0:   required from 'unsigned int CGAL::Poisson_reconstruction_function<Gt>::delaunay_refinement(FT, Sizing_field, unsigned int, FT, Second_sizing_field) [with Sizing_field = CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >; Second_sizing_field = CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >; Gt = CGAL::Epick; FT = double]'
  769 |     unsigned int nb_vertices_added = poisson_refine_triangulation(*m_tr,radius_edge_ratio_bound,sizing_field,second_sizing_field,max_vertices,elarged_bsphere);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:516:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  516 |       NB.push_back( delaunay_refinement(radius_edge_ratio_bound,
  517 |                                         sizing_field2,
  518 |                                         max_vertices,
  519 |                                         enlarge_ratio,
  520 |                                         sizing_field_ok) );
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:769:0:   required from 'unsigned int CGAL::Poisson_reconstruction_function<Gt>::delaunay_refinement(FT, Sizing_field, unsigned int, FT, Second_sizing_field) [with Sizing_field = CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >; Second_sizing_field = CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >; Gt = CGAL::Epick; FT = double]'
  769 |     unsigned int nb_vertices_added = poisson_refine_triangulation(*m_tr,radius_edge_ratio_bound,sizing_field,second_sizing_field,max_vertices,elarged_bsphere);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:516:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  516 |       NB.push_back( delaunay_refinement(radius_edge_ratio_bound,
  517 |                                         sizing_field2,
  518 |                                         max_vertices,
  519 |                                         enlarge_ratio,
  520 |                                         sizing_field_ok) );
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>; Return = bool; First = CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality; Second = CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::Special_wrapper_of_two_functions_keep_pointers<CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::Poisson_reconstruction_function<CGAL::Epick> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  351 |       BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >; Return = bool; First = std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>; Second = std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  351 |       BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<int, double> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<int, double> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::pair<int, double> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<std::pair<int, double> >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<std::pair<int, double> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<std::pair<int, double> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = std::pair<int, double>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<std::pair<int, double> >; Return = bool; First = std::pair<int, double>; Second = std::pair<int, double>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  351 |       BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >; Return = bool; First = std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >; Second = std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  351 |       BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<int>'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<int>, bool, int, int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<int>, bool, int, int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<int>, bool, int, int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<int>, bool, int, int>'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<int>, bool, int, int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<int>, bool, int, int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<int>; Return = bool; First = int; Second = int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  351 |       BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >; Return = bool; First = CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>; Second = CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  351 |       BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Matrix<double, -1, 1>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:45:0:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:0:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41:   required from 'struct Eigen::internal::binary_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   required from 'struct Eigen::internal::evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>; SrcXprType = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >; Functor = assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>; SrcXprType = Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, -1>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >; Derived = Eigen::Matrix<double, -1, -1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:697:18:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  697 |     m_workMatrix = matrix.block(0,0,m_diagSize,m_diagSize) / scale;
      |     ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:0:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
  378 |       (graph,
  379 |        boost::get(&EdgeP::edge_capacity, graph),
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
  381 |        boost::get(&EdgeP::edge_reverse, graph),
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
  383 |        boost::get(&VertexP::vertex_color, graph),
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
  385 |        boost::get(boost::vertex_index,
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
  387 |        0, 1);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:670:23:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:670:31:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Ref.h:44:50:   required from 'struct Eigen::internal::traits<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >::match<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   44 |       DerivedAlignment = int(evaluator<Derived>::Alignment),
      |                                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Ref.h:288:101:   required by substitution of 'template<class Derived> Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >::Ref(const Eigen::DenseBase<Derived>&, typename Eigen::internal::enable_if<(bool)(Eigen::internal::traits<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >::match<Derived>::MatchAtCompileTime), Derived>::type*) [with Derived = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>]'
  288 |                                  typename internal::enable_if<bool(Traits::template match<Derived>::MatchAtCompileTime),Derived>::type* = 0);
      |                                                                                                     ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:704:25:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  704 |           extract_kernel(tmp, eivecs.col(k), eivecs.col(l));
      |           ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::computeDirect(const MatrixType&, int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; MatrixType = Eigen::Matrix<double, 3, 3>]'
  830 |   internal::direct_selfadjoint_eigenvalues<SelfAdjointEigenSolver,Size,NumTraits<Scalar>::IsComplex>::run(*this,matrix,options);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:101:32:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:712:60:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  712 |           eivecs.col(l) -= eivecs.col(k).dot(eivecs.col(l))*eivecs.col(l);
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:731:17:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28:   required from 'struct Eigen::internal::traits<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:398:143:   required from 'Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::TriangularViewType& Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::operator/=(const typename Eigen::internal::traits<T>::Scalar&) [with _MatrixType = Eigen::Matrix<double, 3, 3>; unsigned int _Mode = 1; TriangularViewType = Eigen::TriangularView<Eigen::Matrix<double, 3, 3>, 1>; typename Eigen::internal::traits<T>::Scalar = double]'
  398 |     TriangularViewType&  operator/=(const typename internal::traits<MatrixType>::Scalar& other) { return *this = derived().nestedExpression() / other; }
      |                                                                                                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:455:40:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:20:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator*=(const Scalar&) [with Derived = Eigen::Matrix<double, 3, 1>; Scalar = double]'
   20 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:463:14:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&, int) [with InputType = Eigen::Matrix<double, 3, 3>; _MatrixType = Eigen::Matrix<double, 3, 3>]'
  463 |   m_eivalues *= scale;
      |   ~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:104:26:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:777:23:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:777:31:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 2, 1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 2, 1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 2, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<Eigen::Matrix<double, 2, 1> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:815:17:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28:   required from 'struct Eigen::internal::traits<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 2>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 2> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:398:143:   required from 'Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::TriangularViewType& Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::operator/=(const typename Eigen::internal::traits<T>::Scalar&) [with _MatrixType = Eigen::Matrix<double, 2, 2>; unsigned int _Mode = 1; TriangularViewType = Eigen::TriangularView<Eigen::Matrix<double, 2, 2>, 1>; typename Eigen::internal::traits<T>::Scalar = double]'
  398 |     TriangularViewType&  operator/=(const typename internal::traits<MatrixType>::Scalar& other) { return *this = derived().nestedExpression() / other; }
      |                                                                                                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:455:40:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 2, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:20:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator*=(const Scalar&) [with Derived = Eigen::Matrix<double, 2, 1>; Scalar = double]'
   20 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:463:14:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&, int) [with InputType = Eigen::Matrix<double, 2, 2>; _MatrixType = Eigen::Matrix<double, 2, 2>]'
  463 |   m_eivalues *= scale;
      |   ~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:104:26:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:753:0:   required from 'unsigned int CGAL::Poisson_reconstruction_function<Gt>::delaunay_refinement(FT, Sizing_field, unsigned int, FT) [with Sizing_field = CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >; Gt = CGAL::Epick; FT = double]'
  753 |     return delaunay_refinement(radius_edge_ratio_bound,
  754 |                                sizing_field,
  755 |                                max_vertices,
  756 |                                enlarge_ratio,
  757 |                                internal::Poisson::Constant_sizing_field<Triangulation>());
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:450:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  450 |     NB.push_back( delaunay_refinement(radius_edge_ratio_bound,sizing_field,max_vertices,enlarge_ratio));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>, bool, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality, CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:753:0:   required from 'unsigned int CGAL::Poisson_reconstruction_function<Gt>::delaunay_refinement(FT, Sizing_field, unsigned int, FT) [with Sizing_field = CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >; Gt = CGAL::Epick; FT = double]'
  753 |     return delaunay_refinement(radius_edge_ratio_bound,
  754 |                                sizing_field,
  755 |                                max_vertices,
  756 |                                enlarge_ratio,
  757 |                                internal::Poisson::Constant_sizing_field<Triangulation>());
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:450:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  450 |     NB.push_back( delaunay_refinement(radius_edge_ratio_bound,sizing_field,max_vertices,enlarge_ratio));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality>; Return = bool; First = CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality; Second = CGAL::Poisson_mesh_cell_criteria_3<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > >, CGAL::internal::Poisson::Constant_sizing_field<CGAL::Reconstruction_triangulation_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_data_structure_3<CGAL::Reconstruction_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_vertex_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Delaunay_triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_with_info_3<int, CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_cell_base_3<CGAL::Reconstruction_triangulation_default_geom_traits_3<CGAL::Robust_circumcenter_filtered_traits_3<CGAL::Epick> >, CGAL::Triangulation_ds_cell_base_3<void> > > >, CGAL::Sequential_tag> > > >::Cell_quality]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  351 |       BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:44:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Matrix<double, -1, 1>; U = Eigen::Matrix<double, -1, 1>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:0:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase<Derived>&) [with Derived = Eigen::Matrix<double, 1, -1>; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 1, -1>; Func = Eigen::internal::scalar_max_op<double, double, 0>; Evaluator = Eigen::internal::redux_evaluator<Eigen::Matrix<double, 1, -1> >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_max_op<double, double, 0>; Derived = Eigen::Matrix<double, 1, -1>; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:448:25:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff() const [with int NaNPropagation = 0; Derived = Eigen::Matrix<double, 1, -1>; typename Eigen::internal::traits<T>::Scalar = double]'
  448 |   return derived().redux(Eigen::internal::scalar_max_op<Scalar,Scalar, NaNPropagation>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:466:37:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff() const [with Derived = Eigen::Matrix<double, 1, -1>; typename Eigen::internal::traits<T>::Scalar = double]'
  466 |       return maxCoeff<PropagateFast>();
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:511:85:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  511 |   RealScalar threshold_helper =  numext::abs2<RealScalar>(m_colNormsUpdated.maxCoeff() * NumTraits<RealScalar>::epsilon()) / RealScalar(rows);
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:564:45:   required from 'struct Eigen::internal::unary_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  564 |     CoeffReadCost = int(evaluator<ArgType>::CoeffReadCost) + int(functor_traits<UnaryOp>::Cost),
      |                                             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:540:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  540 |     m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>; Functor = add_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>; Functor = Eigen::internal::add_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>; Func = add_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>; Func = add_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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:177:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator+=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>; Derived = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >]'
  177 |   call_assignment(derived(), other.derived(), internal::add_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:168:9:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  168 |     tmp += this->col(0);
      |     ~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:21:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  170 |     right.noalias() -= tau * tmp * essential.adjoint();
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:21:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  170 |     right.noalias() -= tau * tmp * essential.adjoint();
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 16, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>, 16, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 16, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 16, Eigen::Stride<0, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>, 16, Eigen::Stride<0, 0> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Lhs = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > >; Rhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >; Func = generic_product_impl<Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::DenseShape, Eigen::DenseShape, 5>::sub]'
  280 |     func(dst.col(j), rhsEval.coeff(Index(0),j) * actual_lhs);
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:329:41:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:21:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  170 |     right.noalias() -= tau * tmp * essential.adjoint();
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false>; Functor = add_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false>; Functor = Eigen::internal::add_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false>; Func = add_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false>; Func = add_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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:177:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator+=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false>; Derived = Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >]'
  177 |   call_assignment(derived(), other.derived(), internal::add_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:130:9:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  130 |     tmp += this->row(0);
      |     ~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, Eigen::Dense>'
  372 |   typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type;
      |                                                                                                      ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:369:45:   required from 'struct Eigen::internal::generic_product_impl<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, Eigen::Matrix<double, -1, 1>, Eigen::DenseShape, Eigen::DenseShape, 7>'
  369 |   typedef typename nested_eval<Lhs,1>::type LhsNested;
      |                                             ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_List_iterator<void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:0:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 3, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 3, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 3, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Array<double, 3, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::Array<double, 3, 1> >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Array<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Array.h:45:7:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:34:67:   required from 'Derived& Eigen::ArrayBase<Derived>::operator-=(const Scalar&) [with Derived = Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >; Scalar = double]'
   34 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::sub_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:670:34:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  670 |     scaledMat.diagonal().array() -= shift;
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:41:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator/=(const Scalar&) [with Derived = Eigen::Matrix<double, 3, 3>; Scalar = double]'
   41 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::div_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:672:29:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  672 |     if(scale > 0) scaledMat /= scale;   // TODO for scale==0 we could save the remaining operations
      |                   ~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:640:28:   required from 'static bool Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::extract_kernel(MatrixType&, Eigen::Ref<typename SolverType::RealVectorType>, Eigen::Ref<typename SolverType::RealVectorType>) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>; typename SolverType::RealVectorType = Eigen::Matrix<double, 3, 1>; typename Eigen::internal::conditional<typename SolverType::RealVectorType::IsVectorAtCompileTime, Eigen::InnerStride<1>, Eigen::OuterStride<> >::type = Eigen::InnerStride<1>]'
  640 |     mat.diagonal().cwiseAbs().maxCoeff(&i0);
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:704:25:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:648:23:   required from 'static bool Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::extract_kernel(MatrixType&, Eigen::Ref<typename SolverType::RealVectorType>, Eigen::Ref<typename SolverType::RealVectorType>) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>; typename SolverType::RealVectorType = Eigen::Matrix<double, 3, 1>; typename Eigen::internal::conditional<typename SolverType::RealVectorType::IsVectorAtCompileTime, Eigen::InnerStride<1>, Eigen::OuterStride<> >::type = Eigen::InnerStride<1>]'
  648 |     if(n0>n1) res = c0/sqrt(n0);
      |                     ~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:704:25:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 2, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 2, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 2, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Array<double, 2, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::Array<double, 2, 1> >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Array<double, 2, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Array.h:45:7:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, 2, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:34:67:   required from 'Derived& Eigen::ArrayBase<Derived>::operator-=(const Scalar&) [with Derived = Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, 0> >; Scalar = double]'
   34 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::sub_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:777:34:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 2, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 2, 2> >; MatrixType = Eigen::Matrix<double, 2, 2>]'
  777 |     scaledMat.diagonal().array() -= shift;
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 2, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:41:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator/=(const Scalar&) [with Derived = Eigen::Matrix<double, 2, 2>; Scalar = double]'
   41 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::div_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:780:17:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 2, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 2, 2> >; MatrixType = Eigen::Matrix<double, 2, 2>]'
  780 |       scaledMat /= scale;
      |       ~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, -1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, -1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, -1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, -1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 2, 2>, -1>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:451:40:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<double> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<double>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<double>'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<double>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<double> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<double> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<double>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<double>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:129:9:   required from 'struct boost::bimaps::multiset_of<double, std::less<double> >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<double, std::less<double> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:0:   required from 'class CGAL::Double_map<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, double, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::less<double> >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Slivers_exuder.h:127:0:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<double>::~AssignableConcept()'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept'
  143 |   BOOST_concept(Assignable,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<double>, bool, double, double> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<double>, bool, double, double>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<double>, bool, double, double>'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<double>, bool, double, double>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<double>, bool, double, double> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<double>, bool, double, double> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<double>, bool, double, double>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<double>, bool, double, double>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:132:9:   required from 'struct boost::bimaps::multiset_of<double, std::less<double> >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<double, std::less<double> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:0:   required from 'class CGAL::Double_map<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, double, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> >, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, std::tuple<int, std::pair<int, int> >, std::variant<int, std::pair<int, int> >, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>, int, std::pair<int, int>, std::variant<int, std::pair<int, int> > >, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::less<double> >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Slivers_exuder.h:127:0:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<double>, bool, double, double>::~BinaryFunctionConcept()'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<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());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<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>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:46:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:110:23:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::norm() const [with Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
  110 |   return numext::sqrt(squaredNorm());
      |                       ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:507:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  507 |     m_colNormsDirect.coeffRef(k) = m_qr.col(k).norm();
      |                                    ~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_abs2_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_abs2_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);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_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());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_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>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:46:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [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]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:110:23:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::norm() const [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]'
  110 |   return numext::sqrt(squaredNorm());
      |                       ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:567:77:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  567 |           m_colNormsDirect.coeffRef(j) = m_qr.col(j).tail(rows - k - 1).norm();
      |                                          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:16:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false> >'
 1043 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; 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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; Functor = add_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, -1>, 1, -1, true>, 1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; 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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; Functor = add_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; 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::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; Functor = Eigen::internal::add_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:0:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:0:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:0:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:0:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:0:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:0:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
 1041 |             edge_residual_capacity),
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
 1043 |         choose_pmap(
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
 1048 |         src, sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:0:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:0:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
  249 |                                                       cluster_sink);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:846:33:   required from 'static Derived& Eigen::internal::setIdentity_impl<Derived, Big>::run(Derived&) [with Derived = Eigen::Matrix<double, 3, 3>; bool Big = false]'
  846 |     return m = Derived::Identity(m.rows(), m.cols());
      |                ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:875:50:   required from 'Derived& Eigen::MatrixBase<Derived>::setIdentity() [with Derived = Eigen::Matrix<double, 3, 3>]'
  875 |   return internal::setIdentity_impl<Derived>::run(derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:683:27:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Matrix<double, 3, 1>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:646:68:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:44:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>; U = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:147:18:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 2, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:846:33:   required from 'static Derived& Eigen::internal::setIdentity_impl<Derived, Big>::run(Derived&) [with Derived = Eigen::Matrix<double, 2, 2>; bool Big = false]'
  846 |     return m = Derived::Identity(m.rows(), m.cols());
      |                ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:875:50:   required from 'Derived& Eigen::MatrixBase<Derived>::setIdentity() [with Derived = Eigen::Matrix<double, 2, 2>]'
  875 |   return internal::setIdentity_impl<Derived>::run(derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:790:27:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:370:46:   required from 'void Eigen::internal::tridiagonalization_inplace(MatrixType&, CoeffVectorType&) [with MatrixType = Eigen::Matrix<double, 2, 2>; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  370 |                                   * (conj(h) * matA.col(i).tail(remainingSize)));
      |                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:449:31:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, -1, 1, 0, 2, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, -1, 1, 0, 2, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 1, 0, 2, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:370:35:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<double>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<double> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<double>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<double>'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<double>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<double> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = double]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<double>, bool, double, double>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<double>, bool, double, double> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<double>, bool, double, double>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<double>, bool, double, double>'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<double>, bool, double, double>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<double>, bool, double, double> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<double>; Return = bool; First = double; Second = double]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  351 |       BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:46:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:78:71:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:540:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  540 |     m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:333:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of 'class Eigen::internal::gemv_traits<double, double, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:87:38:   required from 'struct Eigen::internal::general_matrix_vector_product<long long int, double, Eigen::internal::const_blas_data_mapper<double, long long int, 0>, 0, false, double, Eigen::internal::const_blas_data_mapper<double, long long int, 1>, false, 0>'
   87 |   typedef typename Traits::LhsPacket LhsPacket;
      |                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:253:134:   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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Dest = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; typename Dest::Scalar = double]'
  252 |       general_matrix_vector_product
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                   
  253 |           <Index,LhsScalar,LhsMapper,ColMajor,LhsBlasTraits::NeedToConjugate,RhsScalar,RhsMapper,RhsBlasTraits::NeedToConjugate>::run(
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  254 |           actualLhs.rows(), actualLhs.cols(),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                         
  255 |           LhsMapper(actualLhs.data(), actualLhs.outerStride()),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                       
  256 |           RhsMapper(actualRhs.data(), actualRhs.innerStride()),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                       
  257 |           dest.data(), 1,
      |           ~~~~~~~~~~~~~~~                                                                                                             
  258 |           compatibleAlpha);
      |           ~~~~~~~~~~~~~~~~                                                                                                            
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::DenseShape, 7>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Scalar = double]'
  385 |     internal::gemv_dense_selector<Side,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                             (int(MatrixType::Flags)&RowMajorBit) ? RowMajor : ColMajor,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |                             bool(internal::blas_traits<MatrixType>::HasUsableDirectAccess)
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  388 |                            >::run(actual_lhs, actual_rhs, dst, alpha);
      |                            ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:33:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>]'
  349 |   { dst.setZero(); scaleAndAddTo(dst, lhs, rhs, Scalar(1)); }
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                                     ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                      ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                          ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                                                                  ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of 'class Eigen::internal::gemv_traits<double, double, 1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:91:42:   required from 'struct Eigen::internal::general_matrix_vector_product<long long int, double, Eigen::internal::const_blas_data_mapper<double, long long int, 0>, 0, false, double, Eigen::internal::const_blas_data_mapper<double, long long int, 1>, false, 0>'
   91 |   typedef typename HalfTraits::LhsPacket LhsPacketHalf;
      |                                          ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:253:134:   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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Dest = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; typename Dest::Scalar = double]'
  252 |       general_matrix_vector_product
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                   
  253 |           <Index,LhsScalar,LhsMapper,ColMajor,LhsBlasTraits::NeedToConjugate,RhsScalar,RhsMapper,RhsBlasTraits::NeedToConjugate>::run(
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  254 |           actualLhs.rows(), actualLhs.cols(),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                         
  255 |           LhsMapper(actualLhs.data(), actualLhs.outerStride()),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                       
  256 |           RhsMapper(actualRhs.data(), actualRhs.innerStride()),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                       
  257 |           dest.data(), 1,
      |           ~~~~~~~~~~~~~~~                                                                                                             
  258 |           compatibleAlpha);
      |           ~~~~~~~~~~~~~~~~                                                                                                            
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::DenseShape, 7>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Scalar = double]'
  385 |     internal::gemv_dense_selector<Side,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                             (int(MatrixType::Flags)&RowMajorBit) ? RowMajor : ColMajor,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |                             bool(internal::blas_traits<MatrixType>::HasUsableDirectAccess)
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  388 |                            >::run(actual_lhs, actual_rhs, dst, alpha);
      |                            ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:33:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>]'
  349 |   { dst.setZero(); scaleAndAddTo(dst, lhs, rhs, Scalar(1)); }
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                                     ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                      ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                          ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                                                                  ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of 'class Eigen::internal::gemv_traits<double, double, 2>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:95:45:   required from 'struct Eigen::internal::general_matrix_vector_product<long long int, double, Eigen::internal::const_blas_data_mapper<double, long long int, 0>, 0, false, double, Eigen::internal::const_blas_data_mapper<double, long long int, 1>, false, 0>'
   95 |   typedef typename QuarterTraits::LhsPacket LhsPacketQuarter;
      |                                             ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:253:134:   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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Dest = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; typename Dest::Scalar = double]'
  252 |       general_matrix_vector_product
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                   
  253 |           <Index,LhsScalar,LhsMapper,ColMajor,LhsBlasTraits::NeedToConjugate,RhsScalar,RhsMapper,RhsBlasTraits::NeedToConjugate>::run(
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  254 |           actualLhs.rows(), actualLhs.cols(),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                         
  255 |           LhsMapper(actualLhs.data(), actualLhs.outerStride()),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                       
  256 |           RhsMapper(actualRhs.data(), actualRhs.innerStride()),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                       
  257 |           dest.data(), 1,
      |           ~~~~~~~~~~~~~~~                                                                                                             
  258 |           compatibleAlpha);
      |           ~~~~~~~~~~~~~~~~                                                                                                            
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::DenseShape, 7>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Scalar = double]'
  385 |     internal::gemv_dense_selector<Side,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                             (int(MatrixType::Flags)&RowMajorBit) ? RowMajor : ColMajor,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |                             bool(internal::blas_traits<MatrixType>::HasUsableDirectAccess)
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  388 |                            >::run(actual_lhs, actual_rhs, dst, alpha);
      |                            ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:33:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>]'
  349 |   { dst.setZero(); scaleAndAddTo(dst, lhs, rhs, Scalar(1)); }
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                                     ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                      ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                          ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                                                                  ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Dest = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; typename Dest::Scalar = double]'
  296 |           dest.matrix() += actualAlpha * MappedDest(actualDestPtr, dest.size());
      |                            ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:207:26:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> > >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> > >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:207:43:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:330:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of 'class Eigen::internal::gebp_traits<double, double, false, false, 1, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:92:29:   required from 'struct Eigen::internal::product_triangular_matrix_matrix<double, long long int, 5, true, 0, false, 0, false, 0, 1, 0>'
   92 |     SmallPanelWidth   = 2 * EIGEN_PLAIN_ENUM_MAX(Traits::mr,Traits::nr),
      |                                                          ^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; int ProductTag = 8; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::subTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>]'
  357 |   { scaleAndAddTo(dst, lhs, rhs, Scalar(-1)); }
      |     ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                                              ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  457 |         dst.topRows(diagSize) -= ((lhs_alpha-LhsScalar(1))*a_rhs).topRows(diagSize);
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const 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::Matrix<double, -1, -1> >, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const 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::Matrix<double, -1, -1> >, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const 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::Matrix<double, -1, -1> >, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const 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::Matrix<double, -1, -1> >, -1, -1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const 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::Matrix<double, -1, -1> >, -1, -1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const 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::Matrix<double, -1, -1> >, -1, -1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:74:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  462 |         dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:475:5:   required from 'void Eigen::internal::apply_rotation_in_the_plane(Eigen::DenseBase<Derived>&, Eigen::DenseBase<Derived>&, const Eigen::JacobiRotation<OtherScalar>&) [with VectorX = Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>; VectorY = Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>; OtherScalar = double]'
  475 |     EIGEN_PLAIN_ENUM_MIN(evaluator<VectorX>::Alignment, evaluator<VectorY>::Alignment),
      |                                              ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:315:40:   required from 'void Eigen::MatrixBase<Derived>::applyOnTheRight(Eigen::Index, Eigen::Index, const Eigen::JacobiRotation<OtherScalar>&) [with OtherScalar = double; Derived = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >; Eigen::Index = long long int]'
  315 |   internal::apply_rotation_in_the_plane(x, y, j.transpose());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:895:24:   required from 'void Eigen::internal::tridiagonal_qr_step(RealScalar*, RealScalar*, Index, Index, Scalar*, Index) [with int StorageOrder = 0; RealScalar = double; Scalar = double; Index = long long int]'
  895 |       q.applyOnTheRight(k,k+1,rot);
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:548:87:   required from 'Eigen::ComputationInfo Eigen::internal::computeFromTridiagonal_impl(DiagType&, SubDiagType&, Eigen::Index, bool, MatrixType&) [with MatrixType = Eigen::Matrix<double, 3, 3>; DiagType = Eigen::Matrix<double, 3, 1>; SubDiagType = Eigen::Matrix<double, 2, 1>; Eigen::Index = long long int]'
  548 |     internal::tridiagonal_qr_step<MatrixType::Flags&RowMajorBit ? RowMajor : ColMajor>(diag.data(), subdiag.data(), start, end, computeEigenvectors ? eivec.data() : (Scalar*)0, n);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:460:49:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&, int) [with InputType = Eigen::Matrix<double, 3, 3>; _MatrixType = Eigen::Matrix<double, 3, 3>]'
  460 |   m_info = internal::computeFromTridiagonal_impl(diag, m_subdiag, m_maxIterations, computeEigenvectors, m_eivec);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:104:26:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:79:51:   required from 'class Eigen::internal::visitor_evaluator<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >'
   79 |     CoeffReadCost = internal::evaluator<XprType>::CoeffReadCost
      |                                                   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:123:17:   required from 'void Eigen::DenseBase<Derived>::visit(Visitor&) const [with Visitor = Eigen::internal::min_coeff_visitor<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 0>; Derived = Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>]'
  123 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:323:14:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::minCoeff(IndexType*) const [with int NaNPropagation = 0; IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  323 |   this->visit(minVisitor);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:496:37:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::minCoeff(IndexType*) const [with IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  496 |       return minCoeff<PropagateFast>(index);
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:563:35:   required from 'Eigen::ComputationInfo Eigen::internal::computeFromTridiagonal_impl(DiagType&, SubDiagType&, Eigen::Index, bool, MatrixType&) [with MatrixType = Eigen::Matrix<double, 3, 3>; DiagType = Eigen::Matrix<double, 3, 1>; SubDiagType = Eigen::Matrix<double, 2, 1>; Eigen::Index = long long int]'
  563 |       diag.segment(i,n-i).minCoeff(&k);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:460:49:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:363:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_PCA(InputIterator, InputIterator) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd]'
  362 |   CGAL::Default_diagonalize_traits<FT,3>::diagonalize_selfadjoint_covariance_matrix
  363 |     (covariance, eigen_values, eigen_vectors);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:306:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  306 |   compute_PCA(begin, end);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28:   required from 'struct Eigen::internal::traits<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 2, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 2, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:131:14:   required from 'const Eigen::MatrixBase<Derived>::PlainObject Eigen::MatrixBase<Derived>::normalized() const [with Derived = Eigen::Matrix<double, 2, 1>; PlainObject = Eigen::Matrix<double, 2, 1>]'
  131 |     return n / numext::sqrt(z);
      |            ~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/OrthoMethods.h:211:80:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:268:7:   required from 'Eigen::MapBase<Derived, 1>::ScalarWithConstIfNotLvalue& Eigen::MapBase<Derived, 1>::coeffRef(Eigen::Index) [with Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>; ScalarWithConstIfNotLvalue = double; Eigen::Index = long long int]'
   15 |       EIGEN_STATIC_ASSERT((int(internal::evaluator<Derived>::Flags) & LinearAccessBit) || Derived::IsVectorAtCompileTime, \
      |                                                              ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:367:25:   required from 'void Eigen::internal::tridiagonalization_inplace(MatrixType&, CoeffVectorType&) [with MatrixType = Eigen::Matrix<double, 2, 2>; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  367 |     matA.col(i).coeffRef(i+1) = 1;
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:449:31:   required from 'static void Eigen::internal::tridiagonalization_inplace_selector<MatrixType, Size, IsComplex>::run(MatrixType&, DiagonalType&, SubDiagonalType&, CoeffVectorType&, bool) [with DiagonalType = Eigen::Matrix<double, 2, 1>; SubDiagonalType = Eigen::Matrix<double, 1, 1, 0, 1, 1>; MatrixType = Eigen::Matrix<double, 2, 2>; int Size = 2; bool IsComplex = false; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  449 |     tridiagonalization_inplace(mat, hCoeffs);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:434:55:   required from 'void Eigen::internal::tridiagonalization_inplace(MatrixType&, DiagonalType&, SubDiagonalType&, CoeffVectorType&, bool) [with MatrixType = Eigen::Matrix<double, 2, 2>; DiagonalType = Eigen::Matrix<double, 2, 1>; SubDiagonalType = Eigen::Matrix<double, 1, 1, 0, 1, 1>; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  434 |   tridiagonalization_inplace_selector<MatrixType>::run(mat, diag, subdiag, hcoeffs, extractQ);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:458:39:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&, int) [with InputType = Eigen::Matrix<double, 2, 2>; _MatrixType = Eigen::Matrix<double, 2, 2>]'
  458 |   internal::tridiagonalization_inplace(mat, diag, m_subdiag, m_hcoeffs, computeEigenvectors);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:104:26:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:79:51:   required from 'class Eigen::internal::visitor_evaluator<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false> >'
   79 |     CoeffReadCost = internal::evaluator<XprType>::CoeffReadCost
      |                                                   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:123:17:   required from 'void Eigen::DenseBase<Derived>::visit(Visitor&) const [with Visitor = Eigen::internal::min_coeff_visitor<Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>, 0>; Derived = Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>]'
  123 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:323:14:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::minCoeff(IndexType*) const [with int NaNPropagation = 0; IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  323 |   this->visit(minVisitor);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:496:37:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::minCoeff(IndexType*) const [with IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 2, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  496 |       return minCoeff<PropagateFast>(index);
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:563:35:   required from 'Eigen::ComputationInfo Eigen::internal::computeFromTridiagonal_impl(DiagType&, SubDiagType&, Eigen::Index, bool, MatrixType&) [with MatrixType = Eigen::Matrix<double, 2, 2>; DiagType = Eigen::Matrix<double, 2, 1>; SubDiagType = Eigen::Matrix<double, 1, 1, 0, 1, 1>; Eigen::Index = long long int]'
  563 |       diag.segment(i,n-i).minCoeff(&k);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:460:49:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:46:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Matrix<double, -1, 1>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:45:0:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   45 |   RealScalar r0_sqnorm = r0.squaredNorm();
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:0:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:0:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>; SrcXprType = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > >; Functor = assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>; SrcXprType = Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > >; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Assign.h:66:28:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:540:52:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  540 |     m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:207:43:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:50:23:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false>; U = Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true>; ResScalar = double]'
   50 |     return a.transpose().template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:50:23:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true>; U = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>; ResScalar = double]'
   50 |     return a.transpose().template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > >, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > >, -1, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > >, -1, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > >, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > >, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Transpose<Eigen::Map<Eigen::Matrix<double, 1, -1>, 0, Eigen::Stride<0, 0> > >, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:32:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:48:   required from 'static void Eigen::internal::triangular_product_impl<Mode, false, Lhs, true, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; int Mode = 5; Lhs = 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >; Rhs = const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; typename Dest::Scalar = double]'
  194 |             ::run(rhs.transpose(),lhs.transpose(), dstT, alpha);
      |                                   ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:783:113:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 64>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 8, 8, 0, 8, 8> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 8, 8, 0, 8, 8> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 8, 8, 0, 8, 8>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:150:68:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  150 |     Matrix<Scalar,SmallPanelWidth,SmallPanelWidth,LhsStorageOrder> triangularBuffer(a);
      |                                                                    ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 8, 8, 0, 8, 8> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 8, 8, 0, 8, 8> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 8, 8, 0, 8, 8> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:153:32:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 8>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:153:32:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  153 |       triangularBuffer.diagonal().setZero();
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of 'class Eigen::internal::gebp_traits<double, double, false, false, 1, 1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1080:42:   required from 'struct Eigen::internal::gebp_kernel<double, double, long long int, Eigen::internal::blas_data_mapper<double, long long int, 0, 0, 1>, 4, 4, false, false>'
 1080 |   typedef typename HalfTraits::LhsPacket LhsPacketHalf;
      |                                          ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:157:103:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  157 |     gebp_kernel<Scalar, Scalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp_kernel;
      |                                                                                                       ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; int ProductTag = 8; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                                              ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of 'class Eigen::internal::gebp_traits<double, double, false, false, 1, 2>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1085:45:   required from 'struct Eigen::internal::gebp_kernel<double, double, long long int, Eigen::internal::blas_data_mapper<double, long long int, 0, 0, 1>, 4, 4, false, false>'
 1085 |   typedef typename QuarterTraits::LhsPacket LhsPacketQuarter;
      |                                             ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:157:103:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  157 |     gebp_kernel<Scalar, Scalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp_kernel;
      |                                                                                                       ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; int ProductTag = 8; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                                              ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, -1, 1>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 2, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 2, 1>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 2, 1> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Matrix<double, 2, 1>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:128:31:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:93:22:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholder(EssentialPart&, Scalar&, RealScalar&) const [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   93 |     essential = tail / (c0 - beta);
      |                 ~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:46:18:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:44:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; U = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:34:74:   required from 'static void Eigen::internal::selfadjoint_rank2_update_selector<Scalar, Index, UType, VType, 1>::run(Scalar*, Index, const UType&, const VType&, const Scalar&) [with Scalar = double; Index = long long int; UType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; VType = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>]'
   34 |                         (numext::conj(alpha) * numext::conj(u.coeff(i))) * v.tail(size-i)
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:87:10:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:35:60:   required from 'static void Eigen::internal::selfadjoint_rank2_update_selector<Scalar, Index, UType, VType, 1>::run(Scalar*, Index, const UType&, const VType&, const Scalar&) [with Scalar = double; Index = long long int; UType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; VType = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>]'
   35 |                       + (alpha * numext::conj(v.coeff(i))) * u.tail(size-i);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:87:10:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1, 0, 1, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:35:23:   required from 'static void Eigen::internal::selfadjoint_rank2_update_selector<Scalar, Index, UType, VType, 1>::run(Scalar*, Index, const UType&, const VType&, const Scalar&) [with Scalar = double; Index = long long int; UType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; VType = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>]'
   34 |                         (numext::conj(alpha) * numext::conj(u.coeff(i))) * v.tail(size-i)
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   35 |                       + (alpha * numext::conj(v.coeff(i))) * u.tail(size-i);
      |                       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:87:10:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:51:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Matrix<double, -1, 1>; U = Eigen::Matrix<double, -1, 1>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   required from 'typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType Eigen::MatrixBase<Derived>::dot(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Matrix<double, -1, 1>; Derived = Eigen::Matrix<double, -1, 1>; typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType = double; typename Eigen::internal::traits<T>::Scalar = double; typename Eigen::internal::traits<OtherDerived>::Scalar = double]'
   84 |   return internal::dot_nocheck<Derived,OtherDerived>::run(*this, other);
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:71:0:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:0:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:0:   required from 'struct Eigen::internal::evaluator<Eigen::SparseCompressedBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > > >'
  336 |   typedef typename DenseCoeffsBase<Derived,ReadOnlyAccessors>::CoeffReturnType CoeffReturnType;
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:364:0:   required from 'struct Eigen::internal::evaluator<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >'
  364 | struct evaluator<Ref<const SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType> >
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseUtil.h:121:8:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Sparse>'
  121 | struct plain_object_eval<T,Sparse>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseDenseProduct.h:187:0:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::SparseShape, Eigen::DenseShape, ProductType>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix<double, -1, 1>; Lhs = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; int ProductType = 7; Scalar = double]'
  187 |     typedef typename nested_eval<Lhs,((Rhs::Flags&RowMajorBit)==0) ? 1 : Rhs::ColsAtCompileTime>::type LhsNested;
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Matrix<double, -1, 1>; Lhs = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Derived = Eigen::internal::generic_product_impl<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, Eigen::SparseShape, Eigen::DenseShape, 7>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:33:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:0:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:50:23:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true>; U = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>; ResScalar = double]'
   50 |     return a.transpose().template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/BlasUtil.h:506:13:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/VectorBlock.h:56:47:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:341:54:   required from 'static void Eigen::internal::trmv_selector<Mode, 1>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false> >; Rhs = Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >; Dest = Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; int Mode = 6; typename Dest::Scalar = double]'
  341 |       dest.head(diagSize) -= (lhs_alpha-LhsScalar(1))*rhs.head(diagSize);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:18:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1>; int Mode = 6; bool LhsIsTriangular = true; Lhs = const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >; Rhs = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; typename Dest::Scalar = double]'
  457 |         dst.topRows(diagSize) -= ((lhs_alpha-LhsScalar(1))*a_rhs).topRows(diagSize);
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const 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::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const 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::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const 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::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const 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::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const 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::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const 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::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:74:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1>; int Mode = 6; bool LhsIsTriangular = true; Lhs = const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >; Rhs = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; typename Dest::Scalar = double]'
  462 |         dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 long int; DataMapper = Eigen::internal::const_blas_data_mapper<double, long long int, 0>; int nr = 4; bool Conjugate = false; bool PanelMode = false]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:175:15:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  175 |       pack_rhs(blockB, rhs.getSubMapper(actual_k2,0), actual_kc, cols);
      |       ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; int ProductTag = 8; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::subTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>]'
  357 |   { scaleAndAddTo(dst, lhs, rhs, Scalar(-1)); }
      |     ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                              ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 long int; DataMapper = Eigen::internal::const_blas_data_mapper<double, long long int, 0>; int Pack1 = 4; int Pack2 = 2; Packet = __vector(2) double; bool Conjugate = false; bool PanelMode = false]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:203:19:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  203 |           pack_lhs(blockA, LhsMapper(triangularBuffer.data(), triangularBuffer.outerStride()), actualPanelWidth, actualPanelWidth);
      |           ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; int ProductTag = 8; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::subTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>]'
  357 |   { scaleAndAddTo(dst, lhs, rhs, Scalar(-1)); }
      |     ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                  ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                              ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 long int; DataMapper = Eigen::internal::blas_data_mapper<double, long long int, 0, 0, 1>; int mr = 4; int nr = 4; bool ConjugateLhs = false; bool ConjugateRhs = false; ResScalar = double]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:205:22:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 5; int LhsStorageOrder = 0; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  205 |           gebp_kernel(res.getSubMapper(startBlock, 0), blockA, blockB,
      |           ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  206 |                       actualPanelWidth, actualPanelWidth, cols, alpha,
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                       actualPanelWidth, actual_kc, 0, blockBOffset);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; int ProductTag = 8; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::subTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Lhs = Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>; Rhs = Eigen::Matrix<double, -1, -1>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1>, Eigen::TriangularShape, Eigen::DenseShape, 8>]'
  357 |   { scaleAndAddTo(dst, lhs, rhs, Scalar(-1)); }
      |     ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                       ^~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                          ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:78:71:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:142:7:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::coeff(Eigen::Index) const [with Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; CoeffReturnType = const double&; Eigen::Index = long long int]'
  142 |       EIGEN_STATIC_ASSERT(internal::evaluator<Derived>::Flags & LinearAccessBit,
      |                                                         ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:79:20:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholder(EssentialPart&, Scalar&, RealScalar&) const [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   79 |   Scalar c0 = coeff(0);
      |               ~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:46:18:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholderInPlace(Scalar&, RealScalar&) [with Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   46 |   makeHouseholder(essentialPart, tau, beta);
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:363:59:   required from 'void Eigen::internal::tridiagonalization_inplace(MatrixType&, CoeffVectorType&) [with MatrixType = Eigen::Matrix<double, 2, 2>; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  363 |     matA.col(i).tail(remainingSize).makeHouseholderInPlace(h, beta);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:449:31:   required from 'static void Eigen::internal::tridiagonalization_inplace_selector<MatrixType, Size, IsComplex>::run(MatrixType&, DiagonalType&, SubDiagonalType&, CoeffVectorType&, bool) [with DiagonalType = Eigen::Matrix<double, 2, 1>; SubDiagonalType = Eigen::Matrix<double, 1, 1, 0, 1, 1>; MatrixType = Eigen::Matrix<double, 2, 2>; int Size = 2; bool IsComplex = false; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  449 |     tridiagonalization_inplace(mat, hCoeffs);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:434:55:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:115:7:   required from 'const Eigen::MapBase<Derived, 0>::Scalar& Eigen::MapBase<Derived, 0>::coeff(Eigen::Index) const [with Derived = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Scalar = double; Eigen::Index = long long int]'
   15 |       EIGEN_STATIC_ASSERT((int(internal::evaluator<Derived>::Flags) & LinearAccessBit) || Derived::IsVectorAtCompileTime, \
      |                                                              ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:35:54:   required from 'static void Eigen::internal::selfadjoint_rank2_update_selector<Scalar, Index, UType, VType, 1>::run(Scalar*, Index, const UType&, const VType&, const Scalar&) [with Scalar = double; Index = long long int; UType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; VType = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>]'
   35 |                       + (alpha * numext::conj(v.coeff(i))) * u.tail(size-i);
      |                                               ~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointRank2Update.h:87:10:   required from 'Eigen::SelfAdjointView<MatrixType, UpLo>& Eigen::SelfAdjointView<MatrixType, Mode>::rankUpdate(const Eigen::MatrixBase<OtherDerived>&, const Eigen::MatrixBase<OtherDerived>&, const Scalar&) [with DerivedU = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; DerivedV = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; _MatrixType = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; unsigned int UpLo = 1; Scalar = double]'
   85 |   internal::selfadjoint_rank2_update_selector<Scalar, Index, UType, VType,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   86 |     (IsRowMajor ? int(UpLo==Upper ? Lower : Upper) : UpLo)>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   87 |     ::run(_expression().const_cast_derived().data(),_expression().outerStride(),UType(actualU),VType(actualV),actualAlpha);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:375:18:   required from 'void Eigen::internal::tridiagonalization_inplace(MatrixType&, CoeffVectorType&) [with MatrixType = Eigen::Matrix<double, 2, 2>; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  374 |     matA.bottomRightCorner(remainingSize, remainingSize).template selfadjointView<Lower>()
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  375 |       .rankUpdate(matA.col(i).tail(remainingSize), hCoeffs.tail(remainingSize), Scalar(-1));
      |       ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:449:31:   required from 'static void Eigen::internal::tridiagonalization_inplace_selector<MatrixType, Size, IsComplex>::run(MatrixType&, DiagonalType&, SubDiagonalType&, CoeffVectorType&, bool) [with DiagonalType = Eigen::Matrix<double, 2, 1>; SubDiagonalType = Eigen::Matrix<double, 1, 1, 0, 1, 1>; MatrixType = Eigen::Matrix<double, 2, 2>; int Size = 2; bool IsComplex = false; CoeffVectorType = Eigen::Matrix<double, 1, 1, 0, 1, 1>]'
  449 |     tridiagonalization_inplace(mat, hCoeffs);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:434:55:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h:91:0:   required from 'void Eigen::DiagonalPreconditioner<_Scalar>::_solve_impl(const Rhs&, Dest&) const [with Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; _Scalar = double]'
   91 |       x = m_invdiag.array() * b.array() ;
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:147:26:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:0:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  167 |     tmp.noalias() = right * essential;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                                               ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:115:18:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                                               ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:119:18:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:137:106:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, 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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_product_op<double, double>, 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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, 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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:137:77:   required from 'static void Eigen::internal::triangular_matrix_vector_product<Index, Mode, LhsScalar, ConjLhs, RhsScalar, ConjRhs, 1, Version>::run(Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, const ResScalar&) [with Index = long long int; int Mode = 6; LhsScalar = double; bool ConjLhs = false; RhsScalar = double; bool ConjRhs = false; int Version = 0; ResScalar = double]'
  137 |           res.coeffRef(i) += alpha * (cjLhs.row(i).segment(s,r).cwiseProduct(cjRhs.segment(s,r).transpose())).sum();
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:332:12:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 8, 8, 1, 8, 8> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 8, 8, 1, 8, 8> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 8, 8, 1, 8, 8> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 1, 8, 8>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:153:32:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 8, 8, 0, 8, 8> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 8, 8, 0, 8, 8> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 8, 8, 0, 8, 8> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 8, 8, 0, 8, 8> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Matrix<double, 8, 8, 0, 8, 8>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Matrix<double, 8, 8, 0, 8, 8>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:151:29:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 8, 1, 0, 8, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 8, 1, 0, 8, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 8, 1, 0, 8, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 8, 1, 0, 8, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Diagonal<Eigen::Matrix<double, 8, 8, 0, 8, 8>, 0>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:153:42:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:50:23:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true>; U = Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true>; ResScalar = double]'
   50 |     return a.transpose().template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:86:22:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::SparseSelfAdjointView<const Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 1>, Eigen::Matrix<double, -1, 1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::SparseSelfAdjointView<const Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 1>, Eigen::Matrix<double, -1, 1>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::SparseSelfAdjointView<const Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 1>, Eigen::Matrix<double, -1, 1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::SparseSelfAdjointView<const Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 1>, Eigen::Matrix<double, -1, 1>, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::SparseSelfAdjointView<const Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 1>, Eigen::Matrix<double, -1, 1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::SparseSelfAdjointView<const Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 1>, Eigen::Matrix<double, -1, 1>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h:43:0:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:835:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::solve_poisson(SparseLinearAlgebraTraits_d, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  835 |     if(!solver.linear_solver(A, B, X, D))
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:545:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  545 |     if ( ! solve_poisson(solver, lambda) )
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::SparseSelfAdjointView<const Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 1>, Eigen::Matrix<double, -1, 1>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::SparseSelfAdjointView<const Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 1>, Eigen::Matrix<double, -1, 1>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::SparseSelfAdjointView<const Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 1>, Eigen::Matrix<double, -1, 1>, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::SparseSelfAdjointView<const Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 1>, Eigen::Matrix<double, -1, 1>, 0>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::SparseSelfAdjointView<const Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 1>, Eigen::Matrix<double, -1, 1>, 0> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h:43:0:   required from 'void Eigen::internal::conjugate_gradient(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::SparseSelfAdjointView<const Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 1>; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   43 |   VectorType residual = rhs - mat * x; //initial residual
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h:219:0:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:835:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::solve_poisson(SparseLinearAlgebraTraits_d, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  835 |     if(!solver.linear_solver(A, B, X, D))
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:545:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  545 |     if ( ! solve_poisson(solver, lambda) )
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h:86:0:   required from 'void Eigen::internal::conjugate_gradient(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::SparseSelfAdjointView<const Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 1>; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   86 |     p = z + beta * p;                           // update search direction
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h:219:0:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:835:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::solve_poisson(SparseLinearAlgebraTraits_d, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  835 |     if(!solver.linear_solver(A, B, X, D))
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:545:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, Visitor, double, double) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Visitor = CGAL::Poisson_visitor; Gt = CGAL::Epick]'
  545 |     if ( ! solve_poisson(solver, lambda) )
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:587:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(SparseLinearAlgebraTraits_d, bool) [with SparseLinearAlgebraTraits_d = CGAL::Eigen_solver_traits<Eigen::ConjugateGradient<Eigen::SparseMatrix<double, 0, int> > >; Gt = CGAL::Epick]'
  587 |       return compute_implicit_function<SparseLinearAlgebraTraits_d,Poisson_visitor>(solver,Poisson_visitor(),0.02,5);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Poisson_reconstruction_function.h:598:0:   required from 'bool CGAL::Poisson_reconstruction_function<Gt>::compute_implicit_function(bool) [with Gt = CGAL::Epick]'
  598 |     return compute_implicit_function<Solver>(Solver(), smoother_hole_filling);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:108:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  108 |     if ( ! function.compute_implicit_function() )
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -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::Map<Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -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::Map<Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -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::Map<Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -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::Map<Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >; Derived = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:305:153:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:21:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  170 |     right.noalias() -= tau * tmp * essential.adjoint();
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  303 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  304 |                .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of 'void Eigen::internal::gemm_pack_lhs<Scalar, Index, DataMapper, Pack1, Pack2, Packet, 1, Conjugate, PanelMode>::operator()(Scalar*, const DataMapper&, Index, Index, Index, Index) [with Scalar = double; Index = long long int; DataMapper = Eigen::internal::const_blas_data_mapper<double, long long int, 1>; int Pack1 = 4; int Pack2 = 2; Packet = __vector(2) double; bool Conjugate = false; bool PanelMode = false]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:203:19:   required from 'static void Eigen::internal::product_triangular_matrix_matrix<Scalar, Index, Mode, true, LhsStorageOrder, ConjugateLhs, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride, Version>::run(Index, Index, Index, const Scalar*, Index, const Scalar*, Index, Scalar*, Index, Index, const Scalar&, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long long int; int Mode = 6; int LhsStorageOrder = 1; bool ConjugateLhs = false; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; int Version = 0]'
  203 |           pack_lhs(blockA, LhsMapper(triangularBuffer.data(), triangularBuffer.outerStride()), actualPanelWidth, actualPanelWidth);
      |           ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:443:12:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1>; int Mode = 6; bool LhsIsTriangular = true; Lhs = const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >; Rhs = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; typename Dest::Scalar = double]'
  438 |     internal::product_triangular_matrix_matrix<Scalar, Index,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  439 |       Mode, LhsIsTriangular,
      |       ~~~~~~~~~~~~~~~~~~~~~~
  440 |       (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  441 |       (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  442 |       (internal::traits<Dest          >::Flags&RowMajorBit) ? RowMajor : ColMajor, Dest::InnerStrideAtCompileTime>
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  443 |       ::run(
      |       ~~~~~^
  444 |         stripedRows, stripedCols, stripedDepth,   // sizes
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |         &lhs.coeffRef(0,0), lhs.outerStride(),    // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  446 |         &rhs.coeffRef(0,0), rhs.outerStride(),    // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  447 |         &dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(),    // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  448 |         actualAlpha, blocking
      |         ~~~~~~~~~~~~~~~~~~~~~
  449 |       );
      |       ~     
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::TriangularShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix<double, -1, -1>; Lhs = Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>; Rhs = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int ProductTag = 8; Scalar = double]'
  769 |     triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1>
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  770 |         ::run(dst, lhs.nestedExpression(), rhs, alpha);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Matrix<double, -1, -1>; Lhs = Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>; Rhs = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::TriangularShape, Eigen::DenseShape, 8>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:33:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix<double, -1, -1>; Lhs = Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>; Rhs = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::TriangularShape, Eigen::DenseShape, 8>]'
  349 |   { dst.setZero(); scaleAndAddTo(dst, lhs, rhs, Scalar(1)); }
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2256:82: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
 2256 |   typedef typename unpacket_traits<typename unpacket_traits<Packet>::half>::half QuarterPacket;
      |                                                                                  ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2258:56: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
 2258 |          HalfPacketSize = unpacket_traits<HalfPacket>::size,
      |                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2259:62: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
 2259 |          QuarterPacketSize = unpacket_traits<QuarterPacket>::size,
      |                                                              ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2259:62: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2298:39: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
 2298 |               PacketBlock<HalfPacket> kernel_half;
      |                                       ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2298:39: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2304:42: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
 2304 |               PacketBlock<QuarterPacket> kernel_quarter;
      |                                          ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2304:42: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2304:42: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2304:42: warning: ignoring attributes on template argument 'Eigen::internal::unpacket_traits<__vector(2) double>::half' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:564:45:   required from 'struct Eigen::internal::unary_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  564 |     CoeffReadCost = int(evaluator<ArgType>::CoeffReadCost) + int(functor_traits<UnaryOp>::Cost),
      |                                             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:50:63:   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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true>; U = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>; ResScalar = double]'
   50 |     return a.transpose().template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   required from 'typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType Eigen::MatrixBase<Derived>::dot(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>; Derived = Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1, -1, true>; typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType = double; typename Eigen::internal::traits<T>::Scalar = double; typename Eigen::internal::traits<OtherDerived>::Scalar = double]'
   84 |   return internal::dot_nocheck<Derived,OtherDerived>::run(*this, other);
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:380:62:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:19:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Scalar = double]'
  129 |     tmp.noalias() = essential.adjoint() * bottom;
      |     ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::evalTo(Dest&, Workspace&) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  306 |             dst.bottomRightCorner(cornerSize, cornerSize)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  307 |                .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:232:56:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  232 |       if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/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>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/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>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, 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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, 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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Stride<0, 0> >, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 8, 8, 1, 8, 8> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 8, 8, 1, 8, 8> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 8, 8, 1, 8, 8> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 8, 8, 1, 8, 8> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Matrix<double, 8, 8, 1, 8, 8>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Matrix<double, 8, 8, 1, 8, 8>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:151:29:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 1, 0, 8, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 1, 0, 8, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 8, 1, 0, 8, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 8, 1, 0, 8, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 8, 1, 0, 8, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 8, 1, 0, 8, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const 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::Matrix<double, -1, -1> >, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, const Eigen::Matrix<double, -1, -1> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; SrcXprType = Eigen::Block<const 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::Matrix<double, -1, -1> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, const Eigen::Matrix<double, -1, -1> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, const Eigen::Matrix<double, -1, -1> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const 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::Matrix<double, -1, -1> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/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>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -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<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -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<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true> >':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -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<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -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<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -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<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -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<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true> >; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, true>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:32:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:17:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  103 |   mat.noalias() -= V * tmp;
      |   ~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>; SrcXprType = Eigen::Matrix<double, 2, 1>; Functor = assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>; SrcXprType = Eigen::Matrix<double, 2, 1>; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>; Src = Eigen::Matrix<double, 2, 1>; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>; Src = Eigen::Matrix<double, 2, 1>; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, -1, false>; Src = Eigen::Matrix<double, 2, 1>]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Assign.h:66:28:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:16:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:166:45:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:51:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; U = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   required from 'typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType Eigen::MatrixBase<Derived>::dot(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType = double; typename Eigen::internal::traits<T>::Scalar = double; typename Eigen::internal::traits<OtherDerived>::Scalar = double]'
   84 |   return internal::dot_nocheck<Derived,OtherDerived>::run(*this, other);
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:372:86:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:50:63:   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::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true>; U = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>; ResScalar = double]'
   50 |     return a.transpose().template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   required from 'typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType Eigen::MatrixBase<Derived>::dot(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false>, -1, 1, true>; Derived = Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1, -1, true>; typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType = double; typename Eigen::internal::traits<T>::Scalar = double; typename Eigen::internal::traits<OtherDerived>::Scalar = double]'
   84 |   return internal::dot_nocheck<Derived,OtherDerived>::run(*this, other);
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:380:62:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:550:35:   required from 'void Eigen::ColPivHouseholderQR<MatrixType>::computeInPlace() [with _MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |     m_qr.bottomRightCorner(rows-k, cols-k-1)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  550 |         .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/ColPivHouseholderQR.h:477:3:   required from 'Eigen::ColPivHouseholderQR<_MatrixType>& Eigen::ColPivHouseholderQR<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]'
  477 |   computeInPlace();
      |   ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:229:19:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  229 |       m_qr.compute(m_adjoint);
      |       ~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:101:19:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  101 |   if(forward) tmp = T.template triangularView<Upper>()           * tmp;
      |               ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1>; int Mode = 2; bool LhsIsTriangular = true; Lhs = Eigen::Matrix<double, -1, -1, 1, -1, -1>; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  462 |         dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:101:19:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  101 |   if(forward) tmp = T.template triangularView<Upper>()           * tmp;
      |               ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:102:19:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  102 |   else        tmp = T.template triangularView<Upper>().adjoint() * tmp;
      |               ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1>; int Mode = 1; bool LhsIsTriangular = true; Lhs = const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >; Rhs = Eigen::Matrix<double, -1, -1>; typename Dest::Scalar = double]'
  462 |         dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:102:19:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  102 |   else        tmp = T.template triangularView<Upper>().adjoint() * tmp;
      |               ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:46:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:78:71:   required from 'void Eigen::MatrixBase<Derived>::makeHouseholder(EssentialPart&, Scalar&, RealScalar&) const [with EssentialPart = Eigen::VectorBlock<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>; Scalar = double; RealScalar = double]'
   78 |   RealScalar tailSqNorm = size()==1 ? RealScalar(0) : tail.squaredNorm();
      |                                                       ~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:46:18:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1>, -1, 1, false>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41:   required from 'struct Eigen::internal::binary_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 1, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, -1, 1, false> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, 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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, -1, 1, false> > >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:137:114:   required from 'static void Eigen::internal::triangular_matrix_vector_product<Index, Mode, LhsScalar, ConjLhs, RhsScalar, ConjRhs, 1, Version>::run(Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, const ResScalar&) [with Index = long long int; int Mode = 6; LhsScalar = double; bool ConjLhs = false; RhsScalar = double; bool ConjRhs = false; int Version = 0; ResScalar = double]'
  137 |           res.coeffRef(i) += alpha * (cjLhs.row(i).segment(s,r).cwiseProduct(cjRhs.segment(s,r).transpose())).sum();
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:332:12:   required from 'static void Eigen::internal::trmv_selector<Mode, 1>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false> >; Rhs = Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >; Dest = Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; int Mode = 6; typename Dest::Scalar = double]'
  327 |     internal::triangular_matrix_vector_product
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  328 |       <Index,Mode,
      |       ~~~~~~~~~~~~
  329 |        LhsScalar, LhsBlasTraits::NeedToConjugate,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  330 |        RhsScalar, RhsBlasTraits::NeedToConjugate,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  331 |        RowMajor>
      |        ~~~~~~~~~
  332 |       ::run(actualLhs.rows(),actualLhs.cols(),
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  333 |             actualLhs.data(),actualLhs.outerStride(),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  334 |             actualRhsPtr,1,
      |             ~~~~~~~~~~~~~~~
  335 |             dest.data(),dest.innerStride(),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  336 |             actualAlpha);
      |             ~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:18:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/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>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1043:41:   required from 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
 1043 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; 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::Transpose<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; 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::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; 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::Transpose<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; 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::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; Src = 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::Transpose<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; Src = 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::Transpose<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<const Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Derived = Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:341:27:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const 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::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const 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::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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, true>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >, -1, -1, false> >; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, true>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:32:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:78:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
   99 |          VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat;
      |                                                                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<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());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true> >, const Eigen::Block<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>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:50:63:   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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true>; U = Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true>; ResScalar = double]'
   50 |     return a.transpose().template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   required from 'typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType Eigen::MatrixBase<Derived>::dot(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true>; Derived = Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true> >, 1, -1, true>; typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType = double; typename Eigen::internal::traits<T>::Scalar = double; typename Eigen::internal::traits<OtherDerived>::Scalar = double]'
   84 |   return internal::dot_nocheck<Derived,OtherDerived>::run(*this, other);
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:380:62:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; SrcXprType = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >; Functor = assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; SrcXprType = Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>; Src = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false>, -1, 1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> > >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Assign.h:66:28:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:337:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h: In instantiation of 'static void Eigen::internal::selfadjoint_matrix_vector_product<Scalar, Index, StorageOrder, UpLo, ConjugateLhs, ConjugateRhs, Version>::run(Index, const Scalar*, Index, const Scalar*, Scalar*, Scalar) [with Scalar = double; Index = long long int; int StorageOrder = 0; int UpLo = 1; bool ConjugateLhs = false; bool ConjugateRhs = false; int Version = 0]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:229:7:   required from 'static void Eigen::internal::selfadjoint_product_impl<Lhs, LhsMode, false, Rhs, 0, true>::run(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; int LhsMode = 17; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Scalar = double]'
  227 |     internal::selfadjoint_matrix_vector_product<Scalar, Index, (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  228 |                                                 int(LhsUpLo), bool(LhsBlasTraits::NeedToConjugate), bool(RhsBlasTraits::NeedToConjugate)>::run
      |                                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  229 |       (
      |       ^
  230 |         lhs.rows(),                             // size
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  231 |         &lhs.coeffRef(0,0),  lhs.outerStride(), // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  232 |         actualRhsPtr,                           // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  233 |         actualDestPtr,                          // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  234 |         actualAlpha                             // scale factor
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  235 |       );
      |       ~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:805:109:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::SelfAdjointShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; int ProductTag = 3; Scalar = double]'
  805 |     selfadjoint_product_impl<typename Lhs::MatrixType,Lhs::Mode,false,Rhs,0,Rhs::IsVectorAtCompileTime>::run(dst, lhs.nestedExpression(), rhs, alpha);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Derived = Eigen::internal::generic_product_impl<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, Eigen::SelfAdjointShape, Eigen::DenseShape, 3>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:33:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Derived = Eigen::internal::generic_product_impl<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, Eigen::SelfAdjointShape, Eigen::DenseShape, 3>]'
  349 |   { dst.setZero(); scaleAndAddTo(dst, lhs, rhs, Scalar(1)); }
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::Product<Lhs, Rhs, Options>, Eigen::internal::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::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; int Options = 0; Scalar = double; SrcXprType = Eigen::Product<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, 0>]'
  148 |     generic_product_impl<Lhs, Rhs>::evalTo(dst, src.lhs(), src.rhs());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:62:121: warning: ignoring attributes on template argument 'Eigen::internal::packet_traits<double>::type' {aka '__m128d'} [-Wignored-attributes]
   62 |   conj_helper<Packet,Packet,NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(ConjugateLhs,  IsRowMajor), ConjugateRhs> pcj0;
      |                                                                                                                         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:62:121: warning: ignoring attributes on template argument 'Eigen::internal::packet_traits<double>::type' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:63:121: warning: ignoring attributes on template argument 'Eigen::internal::packet_traits<double>::type' {aka '__m128d'} [-Wignored-attributes]
   63 |   conj_helper<Packet,Packet,NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(ConjugateLhs, !IsRowMajor), ConjugateRhs> pcj1;
      |                                                                                                                         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:63:121: warning: ignoring attributes on template argument 'Eigen::internal::packet_traits<double>::type' {aka '__m128d'} [-Wignored-attributes]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 2, 2>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::Matrix<double, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::Matrix<double, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::Matrix<double, 3, 3>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::Matrix<double, 3, 3> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/PCA_util_Eigen.h:86:0:   required from 'void CGAL::internal::assemble_covariance_matrix_3(InputIterator, InputIterator, typename CGAL::Eigen_diagonalize_traits<typename K::FT, 3>::Covariance_matrix&, const typename K::Point_3&, const K&, const typename K::Triangle_3*, const CGAL::Dimension_tag<2>&, const CGAL::Eigen_diagonalize_traits<typename K::FT, 3>&) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Triangle_3<CGAL::Epick>*, std::vector<CGAL::Triangle_3<CGAL::Epick>, std::allocator<CGAL::Triangle_3<CGAL::Epick> > > >; K = CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Epick>; typename CGAL::Eigen_diagonalize_traits<typename K::FT, 3>::Covariance_matrix = std::array<double, 6>; typename K::FT = double; typename K::Point_3 = CGAL::Point_3<CGAL::Epick>; typename K::Triangle_3 = CGAL::Triangle_3<CGAL::Epick>]'
   86 |     transformation = 2 * area * transformation * moment * transformation.transpose();
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/PCA_util_Eigen.h:668:0:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/PCA_util_Eigen.h:86:0:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<Eigen::Matrix<double, 3, 3>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/PCA_util_Eigen.h:86:0:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:166:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/Memory.h: In instantiation of 'Index Eigen::internal::first_default_aligned(const Scalar*, Index) [with Scalar = double; Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:89:68:   required from 'static void Eigen::internal::selfadjoint_matrix_vector_product<Scalar, Index, StorageOrder, UpLo, ConjugateLhs, ConjugateRhs, Version>::run(Index, const Scalar*, Index, const Scalar*, Scalar*, Scalar) [with Scalar = double; Index = long long int; int StorageOrder = 0; int UpLo = 1; bool ConjugateLhs = false; bool ConjugateRhs = false; int Version = 0]'
   89 |     Index alignedStart = (starti) + internal::first_default_aligned(&res[starti], endi-starti);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:229:7:   required from 'static void Eigen::internal::selfadjoint_product_impl<Lhs, LhsMode, false, Rhs, 0, true>::run(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; int LhsMode = 17; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Scalar = double]'
  227 |     internal::selfadjoint_matrix_vector_product<Scalar, Index, (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  228 |                                                 int(LhsUpLo), bool(LhsBlasTraits::NeedToConjugate), bool(RhsBlasTraits::NeedToConjugate)>::run
      |                                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  229 |       (
      |       ^
  230 |         lhs.rows(),                             // size
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  231 |         &lhs.coeffRef(0,0),  lhs.outerStride(), // lhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  232 |         actualRhsPtr,                           // rhs info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  233 |         actualDestPtr,                          // result info
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  234 |         actualAlpha                             // scale factor
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  235 |       );
      |       ~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:805:109:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::SelfAdjointShape, Eigen::DenseShape, ProductTag>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; int ProductTag = 3; Scalar = double]'
  805 |     selfadjoint_product_impl<typename Lhs::MatrixType,Lhs::Mode,false,Rhs,0,Rhs::IsVectorAtCompileTime>::run(dst, lhs.nestedExpression(), rhs, alpha);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Derived = Eigen::internal::generic_product_impl<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, Eigen::SelfAdjointShape, Eigen::DenseShape, 3>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:33:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; Lhs = Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >; Derived = Eigen::internal::generic_product_impl<Eigen::SelfAdjointView<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, 2, 1, true>, -1, 1, false> >, Eigen::SelfAdjointShape, Eigen::DenseShape, 3>]'
  349 |   { dst.setZero(); scaleAndAddTo(dst, lhs, rhs, Scalar(1)); }
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/Memory.h:500:60: warning: ignoring attributes on template argument 'Eigen::internal::packet_traits<double>::type' {aka '__m128d'} [-Wignored-attributes]
  500 |   return first_aligned<unpacket_traits<DefaultPacketType>::alignment>(array, size);
      |                                                            ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, 2, 2>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, 2, 2>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, -1, -1, 0, 2, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 0, 2, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, 2, 2> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:167:27:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:169:25:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Scalar = double]'
  169 |     this->col(0) -= tau * tmp;
      |                     ~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:53:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:170:34:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 1, -1, 1, 1, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 1, -1, 1, 1, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 1, -1, 1, 1, 2> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:129:41:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:131:25:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Scalar = double]'
  131 |     this->row(0) -= tau * tmp;
      |                     ~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:132:29:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheLeft(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Scalar = double]'
  132 |     bottom.noalias() -= tau * essential * tmp;
      |                         ~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:307:42:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:132:41:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:50:23:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false>; U = Eigen::Block<const Eigen::Matrix<double, -1, 1>, -1, 1, true>; ResScalar = double]'
   50 |     return a.transpose().template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:20:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator*=(const Scalar&) [with Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Scalar = double]'
   20 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:161:11:   required from 'void Eigen::MatrixBase<Derived>::applyHouseholderOnTheRight(const EssentialPart&, const Scalar&, Scalar*) [with EssentialPart = Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>; Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Scalar = double]'
  161 |     *this *= Scalar(1)-tau;
      |     ~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:304:43:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:175:44:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 6>, Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:99:96:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 2>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:101:66:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, 1>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:102:66:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::TriangularView<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 5>, Eigen::Matrix<double, -1, -1, 0, 2, 2>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:103:22:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:63:90:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:63:57:   required from 'void Eigen::internal::make_block_householder_triangular_factor(TriangularFactorType&, const VectorsType&, const CoeffsType&) [with TriangularFactorType = Eigen::Matrix<double, -1, -1, 1, -1, -1>; VectorsType = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1>]'
   63 |       triFactor.row(i).tail(rt).noalias() = -hCoeffs(i) * vectors.col(i).tail(rs).adjoint()
      |                                             ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 5>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 5>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 5>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 5>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 5>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::TriangularView<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 5>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:64:57:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:101:19:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  101 |   if(forward) tmp = T.template triangularView<Upper>()           * tmp;
      |               ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::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::Transpose<const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, -1, -1, true> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:102:19:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, -1, 1>, -1>]'
  102 |   else        tmp = T.template triangularView<Upper>().adjoint() * tmp;
      |               ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, -1, -1>; Workspace = Eigen::Matrix<double, 1, -1>; VectorsType = Eigen::Matrix<double, -1, -1>; CoeffsType = Eigen::Matrix<double, -1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:236:47:   required from 'bool Eigen::internal::qr_preconditioner_impl<MatrixType, 2, 0, true>::run(Eigen::JacobiSVD<MatrixType, 2>&, const MatrixType&) [with MatrixType = Eigen::Matrix<double, -1, -1>]'
  236 |         m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:692:30:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  692 |     m_qr_precond_morecols.run(*this, m_scaledMatrix);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, -1, -1>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, -1, -1>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:57:0:   required from here
   57 |     Eigen::JacobiSVD<Matrix::EigenType> jacobiSvd(M.eigen_object(), ::Eigen::ComputeThinU | ::Eigen::ComputeThinV);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, -1>, -1, -1, true>, 1, -1, false> >, const Eigen::Block<const Eigen::Matrix<double, -1, 1>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  779 |       internal::call_assignment(this->derived(), other.derived());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, -1, -1>, 2> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_svd.h:59:0:   required from here
   59 |     B.eigen_object()=jacobiSvd.solve(Vector::EigenType(B.eigen_object()));
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3, 1, 3, 3>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3, 1, 3, 3>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3, 1, 3, 3>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 3, 3, 1, 3, 3> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 3, 3, 1, 3, 3> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 3, 1, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:416:50:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:416:50:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:142:7:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::coeff(Eigen::Index) const [with Derived = Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  142 |       EIGEN_STATIC_ASSERT(internal::evaluator<Derived>::Flags & LinearAccessBit,
      |                                                         ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:182:19:   required from 'Eigen::DenseCoeffsBase<Derived, 0>::CoeffReturnType Eigen::DenseCoeffsBase<Derived, 0>::operator()(Eigen::Index) const [with Derived = Eigen::Block<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1, 1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  182 |       return coeff(index);
      |              ~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:63:53:   required from 'void Eigen::internal::make_block_householder_triangular_factor(TriangularFactorType&, const VectorsType&, const CoeffsType&) [with TriangularFactorType = Eigen::Matrix<double, -1, -1, 1, -1, -1>; VectorsType = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1>]'
   63 |       triFactor.row(i).tail(rt).noalias() = -hCoeffs(i) * vectors.col(i).tail(rs).adjoint()
      |                                              ~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/BlockHouseholder.h:92:55:   required from 'void Eigen::internal::apply_block_householder_on_the_left(MatrixType&, const VectorsType&, const CoeffsType&, bool) [with MatrixType = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; VectorsType = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; CoeffsType = Eigen::VectorBlock<const Eigen::Matrix<double, 1, 1, 0, 1, 1>, -1>]'
   92 |   if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:399:46:   required from 'void Eigen::HouseholderSequence<VectorsType, CoeffsType, Side>::applyThisOnTheLeft(Dest&, Workspace&, bool) const [with Dest = Eigen::Matrix<double, 2, 2>; Workspace = Eigen::Matrix<double, 2, 1>; VectorsType = Eigen::Matrix<double, 2, 2>; CoeffsType = Eigen::Matrix<double, 1, 1, 0, 1, 1>; int Side = 1]'
  399 |           apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_reverse);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/HouseholderSequence.h:320:29:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>; SrcXprType = Eigen::CwiseNullaryOp<scalar_constant_op<double>, Eigen::Matrix<double, -1, -1, 0, 2, 2> >; Functor = mul_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>; SrcXprType = Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, -1, -1, 0, 2, 2> >; Functor = Eigen::internal::mul_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>; Src = Eigen::CwiseNullaryOp<scalar_constant_op<double>, Eigen::Matrix<double, -1, -1, 0, 2, 2> >; Func = mul_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>; Src = Eigen::CwiseNullaryOp<scalar_constant_op<double>, Eigen::Matrix<double, -1, -1, 0, 2, 2> >; Func = mul_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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:20:28:   required from 'Derived& Eigen::DenseBase<Derived>::operator*=(const Scalar&) [with Derived = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Scalar = double]'
   20 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:161:11:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>; Functor = add_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>; Functor = Eigen::internal::add_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>; Func = add_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>; Func = add_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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:177:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator+=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>; Derived = Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> >]'
  177 |   call_assignment(derived(), other.derived(), internal::add_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:168:9:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>; Functor = add_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>; Functor = Eigen::internal::add_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>; Func = add_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>; Func = add_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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:177:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator+=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, 1, -1, false>; Derived = Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >]'
  177 |   call_assignment(derived(), other.derived(), internal::add_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Householder/Householder.h:130:9:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, -1, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, -1, 2>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, -1, 2>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, -1, -1, 0, -1, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 0, -1, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, 2> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Dense>'
  372 |   typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type;
      |                                                                                                      ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:526:76:   required from 'struct Eigen::internal::product_evaluator<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>, 3, Eigen::DenseShape, Eigen::DenseShape, double, double>'
  526 |   typedef typename internal::nested_eval<Lhs,Rhs::ColsAtCompileTime>::type LhsNested;
      |                                                                            ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:29:8:   required from 'struct Eigen::internal::evaluator<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1> >'
   29 | struct evaluator<Product<Lhs, Rhs, Options> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>; Functor = assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, Eigen::Dense>'
  372 |   typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type;
      |                                                                                                      ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:527:76:   required from 'struct Eigen::internal::product_evaluator<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>, 3, Eigen::DenseShape, Eigen::DenseShape, double, double>'
  527 |   typedef typename internal::nested_eval<Rhs,Lhs::RowsAtCompileTime>::type RhsNested;
      |                                                                            ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:29:8:   required from 'struct Eigen::internal::evaluator<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1> >'
   29 | struct evaluator<Product<Lhs, Rhs, Options> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>; Functor = assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, 1>; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1, 0, 2, 2>; typename Dest::Scalar = double]'
  457 |         dst.topRows(diagSize) -= ((lhs_alpha-LhsScalar(1))*a_rhs).topRows(diagSize);
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:74:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; int Mode = 5; bool LhsIsTriangular = true; Lhs = const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; Rhs = Eigen::Matrix<double, -1, -1, 0, 2, 2>; typename Dest::Scalar = double]'
  462 |         dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>, -1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2, 2>, -1, -1, false>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:32:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:48:   required from 'static void Eigen::internal::triangular_product_impl<Mode, false, Lhs, true, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false>; int Mode = 5; Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >; Rhs = const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; typename Dest::Scalar = double]'
  194 |             ::run(rhs.transpose(),lhs.transpose(), dstT, alpha);
      |                                   ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:783:113:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618:37:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618: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) const [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; Rhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  618 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/BlasUtil.h:506:13:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/VectorBlock.h:56:47:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:341:54:   required from 'static void Eigen::internal::trmv_selector<Mode, 1>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false> >; Rhs = Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >; Dest = Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; int Mode = 6; typename Dest::Scalar = double]'
  341 |       dest.head(diagSize) -= (lhs_alpha-LhsScalar(1))*rhs.head(diagSize);
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:194:18:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 29 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1, 0, 2, 2>; int Mode = 6; bool LhsIsTriangular = true; Lhs = const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >; Rhs = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; typename Dest::Scalar = double]'
  457 |         dst.topRows(diagSize) -= ((lhs_alpha-LhsScalar(1))*a_rhs).topRows(diagSize);
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:74:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 29 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:59:   required from 'static void Eigen::internal::triangular_product_impl<Mode, LhsIsTriangular, Lhs, false, Rhs, false>::run(Dest&, const Lhs&, const Rhs&, const typename Dest::Scalar&) [with Dest = Eigen::Matrix<double, -1, -1, 0, 2, 2>; int Mode = 6; bool LhsIsTriangular = true; Lhs = const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >; Rhs = Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>; typename Dest::Scalar = double]'
  462 |         dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:770:14:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 1, 2, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 1, 2, 2>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 1, 2, 2>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, -1, -1, 1, 2, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 1, 2, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 1, 2, 2> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618:37:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618: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) const [with Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; Rhs = Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  618 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:37:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >; Rhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; int ProductTag = 4; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1, 0, 2, 1>, 0, Eigen::Stride<0, 0> > >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; Rhs = Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >; int ProductTag = 4; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 29 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 30 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 30 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, -1, 1, 0, 2, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 2> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 2> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Matrix<double, -1, -1, 0, -1, 2>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Matrix<double, -1, -1, 0, -1, 2>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:16:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 2, 2>, -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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true> >; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, true>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:32:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; 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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, 1, -1, true> >, const Eigen::Block<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618:75:   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) const [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; Rhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>; CoeffReturnType = double; Eigen::Index = long long int]'
  618 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61:   required from 'void Eigen::internal::generic_dense_assignment_kernel<DstEvaluatorTypeT, SrcEvaluatorTypeT, Functor, Version>::assignCoeff(Eigen::Index) [with DstEvaluatorTypeT = Eigen::internal::evaluator<Eigen::Map<Eigen::Matrix<double, 1, -1, 1, 1, 2>, 0, Eigen::Stride<0, 0> > >; SrcEvaluatorTypeT = Eigen::internal::evaluator<Eigen::Product<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 2, 2>, -1, 1, false> >, Eigen::Block<Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, -1, false>, 1> >; Functor = Eigen::internal::assign_op<double, double>; int Version = 0; Eigen::Index = long long int]'
  660 |     m_functor.assignCoeff(m_dst.coeffRef(index), m_src.coeff(index));
      |                                                  ~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:518:25:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 33 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 33 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1043:41:   required from 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
 1043 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   [ skipping 43 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 41 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >, -1, 1, false>; 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, 0, 2, 1> >, const Eigen::Block<const Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1, 1, 1, 2> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >, -1, 1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, true>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >; Functor = sub_assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, true>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, true>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 2, 2>, -1, -1, true>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, 2, 2> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, 2, 2>, -1, -1, false> >, -1, -1, false> >; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, 2, 2>, -1, -1, true>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:32:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 3, 3>, 1, 3, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 34 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:37:   [ skipping 32 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 34 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>; Rhs = Eigen::Transpose<Eigen::Matrix<double, 3, 3> >; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Transpose<Eigen::Matrix<double, 3, 3> >; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 31 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, false>; Src = Eigen::Block<const Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, const Eigen::Matrix<double, -1, -1, 0, 2, 2> >, -1, -1, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, false>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:457:31:   [ skipping 29 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, true>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Functor = sub_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, true>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Func = sub_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, -1, 2>, -1, -1, true>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 1, -1, -1> >, const Eigen::Block<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, -1, -1, false> >; Derived = Eigen::Block<Eigen::Matrix<double, -1, -1, 0, -1, 2>, -1, -1, true>]'
  164 |   call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixMatrix.h:462:32:   [ skipping 29 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 2; Covariance_matrix = std::array<double, 3>; Vector = std::array<double, 2>; Matrix = std::array<double, 4>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:524:0:   required from 'void CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::compute_Monge_basis(const FT*, Monge_form&) [with DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; FT = double]'
  523 |   CGAL::Default_diagonalize_traits<FT,2>::diagonalize_selfadjoint_covariance_matrix
  524 |     (W, eval, evec);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Monge_via_jet_fitting.h:309:0:   required from 'CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::Monge_form CGAL::Monge_via_jet_fitting<DataKernel, LocalKernel, SvdTraits>::operator()(InputIterator, InputIterator, size_t, size_t) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Point_3<CGAL::Epick>*, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > > >; DataKernel = CGAL::Epick; LocalKernel = CGAL::Simple_cartesian<double>; SvdTraits = CGAL::Eigen_svd; size_t = long long unsigned int]'
  309 |   compute_Monge_basis(Z.vector(), monge_form);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:85:0:   required from 'typename NeighborQuery::Kernel::Point_3 CGAL::internal::jet_smooth_point(const typename NeighborQuery::Kernel::Point_3&, NeighborQuery&, unsigned int, typename NeighborQuery::Kernel::FT, unsigned int, unsigned int) [with SvdTraits = CGAL::Eigen_svd; NeighborQuery = CGAL::Point_set_processing_3::internal::Neighbor_query<CGAL::Epick, std::vector<CGAL::Point_3<CGAL::Epick>, std::allocator<CGAL::Point_3<CGAL::Epick> > >&, CGAL::Identity_property_map<CGAL::Point_3<CGAL::Epick> > >; typename NeighborQuery::Kernel::Point_3 = CGAL::Point_3<CGAL::Epick>; typename NeighborQuery::Kernel = CGAL::Epick; typename NeighborQuery::Kernel::FT = double]'
   85 |   Monge_form monge_form = monge_fit(points.begin(), points.end(),
   86 |                                     degree_fitting, degree_monge);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/jet_smooth_point_set.h:252:0:   required from 'void CGAL::jet_smooth_point_set(PointRange&, unsigned int, const NamedParameters&) [with ConcurrencyTag = Sequential_tag; PointRange = std::vector<Point_3<Epick>, std::allocator<Point_3<Epick> > >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  251 |        get<1>(t) = CGAL::internal::jet_smooth_point<SvdTraits>
  252 |          (get (point_map, get<0>(t)), neighbor_query,
  253 |           k,
  254 |           neighbor_radius,
  255 |           degree_fitting,
  256 |           degree_monge);
export_reconstruct.cpp:104:0:   required from here
  104 |     CGAL::jet_smooth_point_set<SEQ_TAG>(points, nNeighbors);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 36 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 33 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 35 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:22:   [ skipping 43 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:37:   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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >; Rhs = Eigen::Matrix<double, 3, 3>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Matrix<double, 3, 3>; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |             ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 42 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 3, 3>, 3, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 45 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >; Rhs = Eigen::Matrix<double, 3, 3>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Matrix<double, 3, 3>; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 42 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 47 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 44 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:277:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, internal_np::No_property> > > > > > >]'
  277 |     return refine_mesh_3_impl(c3t3,
  278 |                               domain,
  279 |                               criteria,
  280 |                               exude_param,
  281 |                               perturb_param,
  282 |                               odt_param,
  283 |                               lloyd_param,
  284 |                               reset,
  285 |                               mesh_options_param,
  286 |                               manifold_options_param,
  287 |                               surface_only_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > >, std::allocator<std::pair<Point_3<Epick>, std::variant<int, std::pair<int, int> > > > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Poisson_mesh_domain_3<Epick>; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Epick>, Mesh_triangulation_3<Poisson_mesh_domain_3<Epick>, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Manifold_options; NP_Tag = internal_np::manifold_param_t; NP_Base = Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:135:0:   required from 'bool CGAL::poisson_surface_reconstruction_delaunay(PointInputIterator, PointInputIterator, PointMap, NormalMap, PolygonMesh&, double, double, double, double, Tag) [with PointInputIterator = __gnu_cxx::__normal_iterator<std::pair<Point_3<Epick>, Vector_3<Epick> >*, std::vector<std::pair<Point_3<Epick>, Vector_3<Epick> > > >; PointMap = First_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; NormalMap = Second_of_pair_property_map<std::pair<Point_3<Epick>, Vector_3<Epick> > >; PolygonMesh = Polyhedron_3<Epick, Polyhedron_items_with_id_3>; Tag = Manifold_with_boundary_tag]'
  135 |     C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  136 |                                         turn_tag_into_mesh_3_manifold_option(tag)
  137 |                                         .surface_only()
  138 |                                         .manifold_with_boundary());
export_reconstruct.cpp:205:0:   required from here
  205 |   const bool success = CGAL::poisson_surface_reconstruction_delaunay(
  206 |     points_wn.begin(), points_wn.end(),
  207 |     CGAL::First_of_pair_property_map<P3V3>(),
  208 |     CGAL::Second_of_pair_property_map<P3V3>(),
  209 |     poly,
  210 |     spacingUse, smAngle, smRadius, smDistance);
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:341:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h: In function 'static void Eigen::internal::trmv_selector<Mode, 1>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false> >; Rhs = Eigen::Transpose<const 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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >; Dest = Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; int Mode = 6]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:332:12: warning: 'result' may be used uninitialized [-Wmaybe-uninitialized]
  327 |     internal::triangular_matrix_vector_product
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  328 |       <Index,Mode,
      |       ~~~~~~~~~~~~
  329 |        LhsScalar, LhsBlasTraits::NeedToConjugate,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  330 |        RhsScalar, RhsBlasTraits::NeedToConjugate,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  331 |        RowMajor>
      |        ~~~~~~~~~
  332 |       ::run(actualLhs.rows(),actualLhs.cols(),
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  333 |             actualLhs.data(),actualLhs.outerStride(),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  334 |             actualRhsPtr,1,
      |             ~~~~~~~~~~~~~~~
  335 |             dest.data(),dest.innerStride(),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  336 |             actualAlpha);
      |             ~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:105:24: note: by argument 5 of type 'const double*' to 'static void Eigen::internal::triangular_matrix_vector_product<Index, Mode, LhsScalar, ConjLhs, RhsScalar, ConjRhs, 1, Version>::run(Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, const ResScalar&) [with Index = long long int; int Mode = 6; LhsScalar = double; bool ConjLhs = false; RhsScalar = double; bool ConjRhs = false; int Version = 0]' declared here
  105 | EIGEN_DONT_INLINE void triangular_matrix_vector_product<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ConjRhs,RowMajor,Version>
      |                        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
g++  -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.7/BH/include' -I'D:/RCompile/CRANpkg/lib/4.7/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"   -DCGAL_HEADER_ONLY=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c export_remesh_acvd.cpp -o export_remesh_acvd.o
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:205,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dimension.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Bbox_2.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic_classes.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
                 from SurfaceMesh.h:17,
                 from export_remesh_acvd.cpp:7:
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                       ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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) {
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:174:
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/bind.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian_converter.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Filtered_kernel.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:21:
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/property_map.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
                 from SurfaceMesh.h:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/std_thread.h:43,
                 from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/thread:45,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/config.h:428,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20:
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:165:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<float, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<float> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46:   required from here
   24 |     ResAlignment = traits<Quaternion<float> >::Alignment
      |                                              ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:271:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<float, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<float, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<float> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<float>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3:   required from here
   27 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<double> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47:   required from here
   98 |     ResAlignment = traits<Quaternion<double> >::Alignment
      |                                               ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<double> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<double>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3:   required from here
  102 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/scoped_ptr.hpp:13,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/adjacency_list.hpp:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:44,
                 from export_remesh_acvd.cpp:11:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/scoped_ptr.hpp:63:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   63 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 16>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 4, 4> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 4, 4> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 4, 4>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:567:13:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  567 |   Matrix4x4 zero_mat;
      |             ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 4>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 4>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 4>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 4, 4> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 4, 4> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 4, 4> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 4, 4>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:567:13:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  567 |   Matrix4x4 zero_mat;
      |             ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 4, 4> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 4, 4> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Matrix<double, 4, 4>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Matrix<double, 4, 4>]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:568:19:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  568 |   zero_mat.setZero();
      |   ~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 9>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 3, 3> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 3, 3>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:143:12:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  143 |   Matrix3d A;
      |            ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 3, 3> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 3, 3> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 3, 3>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:143:12:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  143 |   Matrix3d A;
      |            ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 3>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 3, 1> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 3, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/SVDBase.h:274:22:   required from 'class Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, 3, 3>, 2> >'
  274 |   SingularValuesType m_singularValues;
      |                      ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:488:60:   required from 'class Eigen::JacobiSVD<Eigen::Matrix<double, 3, 3>, 2>'
  488 | template<typename _MatrixType, int QRPreconditioner> class JacobiSVD
      |                                                            ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 3, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 3, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:488:60:   required from 'class Eigen::JacobiSVD<Eigen::Matrix<double, 3, 3>, 2>'
  488 | template<typename _MatrixType, int QRPreconditioner> class JacobiSVD
      |                                                            ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:210:19:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  210 |   tempMatrix2 = V * tempMatrix;
      |                 ~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:214:81:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  214 |   Eigen::Matrix<typename GT::FT, 3, 1> displacement_temp = tempMatrix2 * (b - A * p_temp);
      |                                                                               ~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:214:77:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  214 |   Eigen::Matrix<typename GT::FT, 3, 1> displacement_temp = tempMatrix2 * (b - A * p_temp);
      |                                                                          ~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:214:72:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  214 |   Eigen::Matrix<typename GT::FT, 3, 1> displacement_temp = tempMatrix2 * (b - A * p_temp);
      |                                                            ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/assert.hpp:35,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::associative_property_map<std::map<long long unsigned int, int> >, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:76:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::associative_property_map<std::map<long long unsigned int, int> >; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::associative_property_map<std::map<long long unsigned int, int> >, long long unsigned int> >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::associative_property_map<std::map<long long unsigned int, int> >, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:76:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:31,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:20:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:180:7:   required from 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::associative_property_map<std::map<long long unsigned int, int> >; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::associative_property_map<std::map<long long unsigned int, int> >, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::associative_property_map<std::map<long long unsigned int, int> >, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::associative_property_map<std::map<long long unsigned int, int> >, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::associative_property_map<std::map<long long unsigned int, int> >, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:76:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/int.hpp:20,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda_fwd.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_spec.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/or.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/type_traits.h:16,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Algebraic_structure_traits.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/number_type_basic.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:28:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:410:91:   required from 'CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<GT> CGAL::Polygon_mesh_processing::internal::principal_curvatures_and_directions_from_anisotropic_measures(std::array<typename GT::FT, 9>, typename GT::FT, typename GT::Vector_3, typename GT::FT) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::FT = double; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>]'
  410 |   Eigen::Matrix<typename GT::FT, 3, 3> v_muXY = Eigen::Matrix<typename GT::FT, 3, 3>::Zero();
      |                                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<Eigen::Matrix<double, 3, 3>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:421:26:   required from 'CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<GT> CGAL::Polygon_mesh_processing::internal::principal_curvatures_and_directions_from_anisotropic_measures(std::array<typename GT::FT, 9>, typename GT::FT, typename GT::Vector_3, typename GT::FT) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::FT = double; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>]'
  421 |   v_muXY = 0.5 * (v_muXY + v_muXY.transpose()) + K * u * u.transpose();
      |                  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:421:16:   required from 'CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<GT> CGAL::Polygon_mesh_processing::internal::principal_curvatures_and_directions_from_anisotropic_measures(std::array<typename GT::FT, 9>, typename GT::FT, typename GT::Vector_3, typename GT::FT) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::FT = double; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>]'
  421 |   v_muXY = 0.5 * (v_muXY + v_muXY.transpose()) + K * u * u.transpose();
      |            ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:421:52:   required from 'CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<GT> CGAL::Polygon_mesh_processing::internal::principal_curvatures_and_directions_from_anisotropic_measures(std::array<typename GT::FT, 9>, typename GT::FT, typename GT::Vector_3, typename GT::FT) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::FT = double; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>]'
  421 |   v_muXY = 0.5 * (v_muXY + v_muXY.transpose()) + K * u * u.transpose();
      |                                                  ~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<Eigen::Matrix<double, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<Eigen::Matrix<double, 3, 1>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > >, const Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > >, const Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > >, const Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > >, const Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > >, const Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:421:48:   required from 'CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<GT> CGAL::Polygon_mesh_processing::internal::principal_curvatures_and_directions_from_anisotropic_measures(std::array<typename GT::FT, 9>, typename GT::FT, typename GT::Vector_3, typename GT::FT) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::FT = double; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>]'
  421 |   v_muXY = 0.5 * (v_muXY + v_muXY.transpose()) + K * u * u.transpose();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:92:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 3, 3> >'
   92 |             >::type DiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:97:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 3, 3> >'
   97 |             >::type SubDiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 2>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:97:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 3, 3> >'
   97 |             >::type SubDiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 2, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 2, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 2, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 3, 3>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 3, 3> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:679:37:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  679 |   RealScalar scale = matrix.cwiseAbs().template maxCoeff<PropagateNaN>();
      |                      ~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:691:29:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  691 |     m_scaledMatrix = matrix / scale;
      |                      ~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 3, 3>, -1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, -1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 3, 3>, -1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::Matrix<double, 3, 3>, -1, -1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 0, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28:   required from 'struct Eigen::internal::traits<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:697:60:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  697 |     m_workMatrix = matrix.block(0,0,m_diagSize,m_diagSize) / scale;
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 3, 3> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 3, 3> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 3, 3> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 3, 3> >, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:705:61:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  705 |   RealScalar maxDiagEntry = m_workMatrix.cwiseAbs().diagonal().maxCoeff();
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_opposite_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:765:62:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  765 |       if(computeU() && (a<RealScalar(0))) m_matrixU.col(i) = -m_matrixU.col(i);
      |                                                              ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::associative_property_map<std::map<long long unsigned int, int> >, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::associative_property_map<std::map<long long unsigned int, int> >, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:76:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 2>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 2>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 2, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 2, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 2, 2> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 1, 3, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 1, 3, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 1, 3, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 1, 3, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 1, 3, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 1, 3, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:20:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator*=(const Scalar&) [with Derived = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>; Scalar = double]'
   20 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:758:39:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  758 |       if(computeU()) m_matrixU.col(i) *= m_workMatrix.coeff(i,i)/a;
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:670:23:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:670:31:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:277:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Ref.h:44:50:   required from 'struct Eigen::internal::traits<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >::match<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   44 |       DerivedAlignment = int(evaluator<Derived>::Alignment),
      |                                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Ref.h:288:101:   required by substitution of 'template<class Derived> Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >::Ref(const Eigen::DenseBase<Derived>&, typename Eigen::internal::enable_if<(bool)(Eigen::internal::traits<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >::match<Derived>::MatchAtCompileTime), Derived>::type*) [with Derived = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>]'
  288 |                                  typename internal::enable_if<bool(Traits::template match<Derived>::MatchAtCompileTime),Derived>::type* = 0);
      |                                                                                                     ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:704:25:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  704 |           extract_kernel(tmp, eivecs.col(k), eivecs.col(l));
      |           ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::computeDirect(const MatrixType&, int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; MatrixType = Eigen::Matrix<double, 3, 3>]'
  830 |   internal::direct_selfadjoint_eigenvalues<SelfAdjointEigenSolver,Size,NumTraits<Scalar>::IsComplex>::run(*this,matrix,options);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:427:28:   required from 'CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<GT> CGAL::Polygon_mesh_processing::internal::principal_curvatures_and_directions_from_anisotropic_measures(std::array<typename GT::FT, 9>, typename GT::FT, typename GT::Vector_3, typename GT::FT) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::FT = double; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>]'
  427 |   eigensolver.computeDirect(v_muXY);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:712:60:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  712 |           eivecs.col(l) -= eivecs.col(k).dot(eivecs.col(l))*eivecs.col(l);
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:731:17:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 3, 3>, 1, 3, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:475:5:   required from 'void Eigen::internal::apply_rotation_in_the_plane(Eigen::DenseBase<Derived>&, Eigen::DenseBase<Derived>&, const Eigen::JacobiRotation<OtherScalar>&) [with VectorX = Eigen::Block<Eigen::Matrix<double, 3, 3>, 1, 3, false>; VectorY = Eigen::Block<Eigen::Matrix<double, 3, 3>, 1, 3, false>; OtherScalar = double]'
  475 |     EIGEN_PLAIN_ENUM_MIN(evaluator<VectorX>::Alignment, evaluator<VectorY>::Alignment),
      |                                              ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:299:40:   required from 'void Eigen::MatrixBase<Derived>::applyOnTheLeft(Eigen::Index, Eigen::Index, const Eigen::JacobiRotation<OtherScalar>&) [with OtherScalar = double; Derived = Eigen::Matrix<double, 3, 3>; Eigen::Index = long long int]'
  299 |   internal::apply_rotation_in_the_plane(x, y, j);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:733:40:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  733 |             m_workMatrix.applyOnTheLeft(p,q,j_left);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from 'void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from 'void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:15,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:45:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function 'void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
   39 |     void constraints()
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 3, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 3, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 3, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Array<double, 3, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::Array<double, 3, 1> >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Array<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Array.h:45:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:34:67:   required from 'Derived& Eigen::ArrayBase<Derived>::operator-=(const Scalar&) [with Derived = Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >; Scalar = double]'
   34 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::sub_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:670:34:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  670 |     scaledMat.diagonal().array() -= shift;
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:640:28:   required from 'static bool Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::extract_kernel(MatrixType&, Eigen::Ref<typename SolverType::RealVectorType>, Eigen::Ref<typename SolverType::RealVectorType>) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>; typename SolverType::RealVectorType = Eigen::Matrix<double, 3, 1>; typename Eigen::internal::conditional<typename SolverType::RealVectorType::IsVectorAtCompileTime, Eigen::InnerStride<1>, Eigen::OuterStride<> >::type = Eigen::InnerStride<1>]'
  640 |     mat.diagonal().cwiseAbs().maxCoeff(&i0);
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:704:25:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:648:23:   required from 'static bool Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::extract_kernel(MatrixType&, Eigen::Ref<typename SolverType::RealVectorType>, Eigen::Ref<typename SolverType::RealVectorType>) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>; typename SolverType::RealVectorType = Eigen::Matrix<double, 3, 1>; typename Eigen::internal::conditional<typename SolverType::RealVectorType::IsVectorAtCompileTime, Eigen::InnerStride<1>, Eigen::OuterStride<> >::type = Eigen::InnerStride<1>]'
  648 |     if(n0>n1) res = c0/sqrt(n0);
      |                     ~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:704:25:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, 3, 3>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, 3, 3>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 0, 3, 3>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, -1, -1, 0, 3, 3> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 0, 3, 3> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:846:33:   required from 'static Derived& Eigen::internal::setIdentity_impl<Derived, Big>::run(Derived&) [with Derived = Eigen::Matrix<double, 3, 3>; bool Big = false]'
  846 |     return m = Derived::Identity(m.rows(), m.cols());
      |                ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:875:50:   required from 'Derived& Eigen::MatrixBase<Derived>::setIdentity() [with Derived = Eigen::Matrix<double, 3, 3>]'
  875 |   return internal::setIdentity_impl<Derived>::run(derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:892:21:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:475:5:   required from 'void Eigen::internal::apply_rotation_in_the_plane(Eigen::DenseBase<Derived>&, Eigen::DenseBase<Derived>&, const Eigen::JacobiRotation<OtherScalar>&) [with VectorX = Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>; VectorY = Eigen::Block<Eigen::Matrix<double, 2, 2>, 1, 2, false>; OtherScalar = double]'
  475 |     EIGEN_PLAIN_ENUM_MIN(evaluator<VectorX>::Alignment, evaluator<VectorY>::Alignment),
      |                                              ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:299:40:   required from 'void Eigen::MatrixBase<Derived>::applyOnTheLeft(Eigen::Index, Eigen::Index, const Eigen::JacobiRotation<OtherScalar>&) [with OtherScalar = double; Derived = Eigen::Matrix<double, 2, 2>; Eigen::Index = long long int]'
  299 |   internal::apply_rotation_in_the_plane(x, y, j);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/misc/RealSvd2x2.h:46:19:   required from 'void Eigen::internal::real_2x2_jacobi_svd(const MatrixType&, Index, Index, Eigen::JacobiRotation<RealScalar>*, Eigen::JacobiRotation<RealScalar>*) [with MatrixType = Eigen::Matrix<double, 3, 3>; RealScalar = double; Index = long long int]'
   46 |   m.applyOnTheLeft(0,1,rot1);
      |   ~~~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:730:42:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  730 |             internal::real_2x2_jacobi_svd(m_workMatrix, p, q, &j_left, &j_right);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:79:51:   required from 'class Eigen::internal::visitor_evaluator<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >'
   79 |     CoeffReadCost = internal::evaluator<XprType>::CoeffReadCost
      |                                                   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 0>; Derived = Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>]'
  123 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:374:14:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff(IndexType*) const [with int NaNPropagation = 0; IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  374 |   this->visit(maxVisitor);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:501:37:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::maxCoeff(IndexType*) const [with IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  501 |       return maxCoeff<PropagateFast>(index);
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:777:88:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>& Eigen::JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  777 |     RealScalar maxRemainingSingularValue = m_singularValues.tail(m_diagSize-i).maxCoeff(&pos);
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:165:3:   required from 'struct boost::CopyConstructibleConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >'
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from 'void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:130:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function 'boost::CopyConstructibleConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >::~CopyConstructibleConcept()'
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro 'BOOST_concept'
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from 'void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from 'void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function 'boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >::~IncidenceGraphConcept()'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro 'BOOST_concept'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from 'void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from 'void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::default_color_type>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValue<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValueConcept<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::default_color_type>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValue<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValueConcept<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:505:5:   required from 'struct boost::concepts::ColorValue<boost::default_color_type>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValueConcept<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from 'void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from 'void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function 'boost::concepts::ColorValueConcept<boost::default_color_type>::~ColorValueConcept()'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro 'BOOST_concept'
  502 | BOOST_concept(ColorValue, (C))
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Matrix<double, 3, 1>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:646:68:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:44:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>; U = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:147:18:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 0>; _Scalar = double; int _Rows = 3; int _Cols = 1; int _Options = 0; int _MaxRows = 3; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:214:40:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  214 |   Eigen::Matrix<typename GT::FT, 3, 1> displacement_temp = tempMatrix2 * (b - A * p_temp);
      |                                        ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:165:3:   required from 'struct boost::CopyConstructibleConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >'
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:134:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:134:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:208:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:134:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::default_color_type>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValue<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValueConcept<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::default_color_type]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::default_color_type>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValue<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValueConcept<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::default_color_type]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:505:5:   required from 'struct boost::concepts::ColorValue<boost::default_color_type>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValueConcept<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::ColorValue<C>::~ColorValue() [with C = boost::default_color_type]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  505 |     BOOST_CONCEPT_USAGE(ColorValue)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from 'void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from 'void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from 'void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from 'void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from 'void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from 'void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from 'void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from 'void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from 'void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from 'void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:148:7:   required from 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41:   required from 'struct Eigen::internal::binary_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> > >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>'
  739 |     CoeffReadCost = int(evaluator<Lhs>::CoeffReadCost) + int(evaluator<Rhs>::CoeffReadCost) + int(functor_traits<BinaryOp>::Cost),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   required from 'struct Eigen::internal::evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> > > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>; SrcXprType = Eigen::CwiseBinaryOp<scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> > >; Functor = assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>; SrcXprType = Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, -1, -1, false>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, -1, 0, 3, 3> > >; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SVD/JacobiSVD.h:549:14:   required from 'Eigen::JacobiSVD<MatrixType, QRPreconditioner>::JacobiSVD(const MatrixType&, unsigned int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; int QRPreconditioner = 2; MatrixType = Eigen::Matrix<double, 3, 3>]'
  549 |       compute(matrix, computationOptions);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:544:69:   required from 'struct Eigen::internal::product_evaluator<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 1>, 3, Eigen::DenseShape, Eigen::DenseShape, double, double>'
  544 |   typedef typename find_best_packet<Scalar,ColsAtCompileTime>::type RhsVecPacketType;
      |                                                                     ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:29:8:   required from 'struct Eigen::internal::evaluator<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 1> >'
   29 | struct evaluator<Product<Lhs, Rhs, Options> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 1>; SrcXprType = Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 1>; Functor = assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 1>; SrcXprType = Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 1>; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 1>; Src = Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 1>; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:29:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 0>; _Scalar = double; int _Rows = 3; int _Cols = 1; int _Options = 0; int _MaxRows = 3; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:214:40:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  214 |   Eigen::Matrix<typename GT::FT, 3, 1> displacement_temp = tempMatrix2 * (b - A * p_temp);
      |                                        ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:286:39:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 0>; _Scalar = double; int _Rows = 3; int _Cols = 3; int _Options = 0; int _MaxRows = 3; int _MaxCols = 3]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:210:15:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  210 |   tempMatrix2 = V * tempMatrix;
      |   ~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long long int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:514:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:109:22: note: in a call to non-static member function 'boost::SignedInteger<long long int>::~SignedInteger()'
  109 |   template <> struct SignedInteger< ::boost::long_long_type> {};
      |                      ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, boost::no_property> >, boost::no_property> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long long unsigned int>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]'
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/connected_components.hpp:106:23:   required from 'typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long long unsigned int, int> >; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]'
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1243 |       if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:409:50:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 3, 3>, 1, 3, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 0>; _Scalar = double; int _Rows = 3; int _Cols = 1; int _Options = 0; int _MaxRows = 3; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:214:40:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  214 |   Eigen::Matrix<typename GT::FT, 3, 1> displacement_temp = tempMatrix2 * (b - A * p_temp);
      |                                        ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:37:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 0>; _Scalar = double; int _Rows = 3; int _Cols = 1; int _Options = 0; int _MaxRows = 3; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:214:40:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  214 |   Eigen::Matrix<typename GT::FT, 3, 1> displacement_temp = tempMatrix2 * (b - A * p_temp);
      |                                        ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 3, 1>, 3, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 0>; _Scalar = double; int _Rows = 3; int _Cols = 1; int _Options = 0; int _MaxRows = 3; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:214:40:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  214 |   Eigen::Matrix<typename GT::FT, 3, 1> displacement_temp = tempMatrix2 * (b - A * p_temp);
      |                                        ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Matrix<double, 3, 3>; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 0>; _Scalar = double; int _Rows = 3; int _Cols = 1; int _Options = 0; int _MaxRows = 3; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:214:40:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  214 |   Eigen::Matrix<typename GT::FT, 3, 1> displacement_temp = tempMatrix2 * (b - A * p_temp);
      |                                        ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 0>; _Scalar = double; int _Rows = 3; int _Cols = 1; int _Options = 0; int _MaxRows = 3; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:214:40:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  214 |   Eigen::Matrix<typename GT::FT, 3, 1> displacement_temp = tempMatrix2 * (b - A * p_temp);
      |                                        ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 3, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 0>; _Scalar = double; int _Rows = 3; int _Cols = 1; int _Options = 0; int _MaxRows = 3; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:214:40:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  214 |   Eigen::Matrix<typename GT::FT, 3, 1> displacement_temp = tempMatrix2 * (b - A * p_temp);
      |                                        ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 3, 3>, 3, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 0>; _Scalar = double; int _Rows = 3; int _Cols = 3; int _Options = 0; int _MaxRows = 3; int _MaxCols = 3]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:210:15:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  210 |   tempMatrix2 = V * tempMatrix;
      |   ~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>; Rhs = Eigen::Matrix<double, 3, 3>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Matrix<double, 3, 3>; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Matrix<double, 3, 3>; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 0>; _Scalar = double; int _Rows = 3; int _Cols = 3; int _Options = 0; int _MaxRows = 3; int _MaxCols = 3]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:210:15:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  210 |   tempMatrix2 = V * tempMatrix;
      |   ~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:416:50:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 1>, 0> >, 0>; _Scalar = double; int _Rows = 3; int _Cols = 1; int _Options = 0; int _MaxRows = 3; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:214:40:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  214 |   Eigen::Matrix<typename GT::FT, 3, 1> displacement_temp = tempMatrix2 * (b - A * p_temp);
      |                                        ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:225:24:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Matrix<double, 3, 3>, Eigen::Matrix<double, 3, 3>, 0>; _Scalar = double; int _Rows = 3; int _Cols = 3; int _Options = 0; int _MaxRows = 3; int _MaxCols = 3]'
  225 |       return Base::_set(other);
      |              ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:210:15:   required from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  210 |   tempMatrix2 = V * tempMatrix;
      |   ~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:225:64:   required from 'void CGAL::Polygon_mesh_processing::internal::compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>&, typename GT::Point_3&, int&) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::Point_3 = CGAL::Point_3<CGAL::Epick>]'
  225 |   typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
      |                                        ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1064:43:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
 1064 |           compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:22:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:37:   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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >; Rhs = Eigen::Transpose<Eigen::Matrix<double, 3, 1> >; int ProductTag = 4; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Transpose<Eigen::Matrix<double, 3, 1> >; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |             ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >; Rhs = Eigen::Transpose<Eigen::Matrix<double, 3, 1> >; int ProductTag = 4; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Transpose<Eigen::Matrix<double, 3, 1> >; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Epick, CGAL::internal_np::geom_traits_t, CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> > >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = CGAL::Epick; NP_Tag = CGAL::internal_np::geom_traits_t; NP_Base = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::internal_np::vertex_point_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:451:40:   required from 'std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]'
  451 |       interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  452 |                                                           .vertex_point_map(vpm).geom_traits(gt));
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32:   required from 'bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long long unsigned int]'
 1406 |   auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
      |             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63:   required from here
   44 |         PMP::approximated_centroidal_Voronoi_diagram_remeshing(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   45 |             mesh, nb_clusters,
      |             ~~~~~~~~~~~~~~~~~~                                 
   46 |             CGAL::parameters::vertex_count_ratio(vert_count_ratio));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:294:
In copy constructor 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::PlainObjectBase<Derived>&) [with Derived = Eigen::Matrix<double, 3, 1>]',
    inlined from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>&) [with _Scalar = double; int _Rows = 3; int _Cols = 1; int _Options = 0; int _MaxRows = 3; int _MaxCols = 1]' at D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:414:65,
    inlined from 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick]' at D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:156:8:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:512:17: warning: '*(const CGAL::VectorC3<CGAL::Epick>::FT_*)((char*)&svd + offsetof(Eigen::JacobiSVD<Eigen::Matrix<double, 3, 3, 0, 3, 3>, 2>,Eigen::JacobiSVD<Eigen::Matrix<double, 3, 3, 0, 3, 3>, 2>::<unnamed>.Eigen::SVDBase<Eigen::JacobiSVD<Eigen::Matrix<double, 3, 3, 0, 3, 3>, 2> >::m_singularValues.Eigen::Matrix<double, 3, 1, 0, 3, 1>::<unnamed>.Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 1, 0, 3, 1> >::m_storage.Eigen::DenseStorage<double, 3, 3, 1, 0>::m_data.Eigen::internal::plain_array<double, 3, 0, 0>::array[2]))' may be used uninitialized [-Wmaybe-uninitialized]
  512 |       : Base(), m_storage(other.m_storage) { }
      |                 ^~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h: In function 'typename GT::Vector_3 CGAL::Polygon_mesh_processing::internal::compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>&, const typename GT::Point_3&, int&) [with GT = CGAL::Epick]':
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:153:30: note: 'svd' declared here
  153 |   Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
      |                              ^~~
g++  -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.7/BH/include' -I'D:/RCompile/CRANpkg/lib/4.7/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"   -DCGAL_HEADER_ONLY=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c export_remesh_delaunay.cpp -o export_remesh_delaunay.o
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:205,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dimension.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Bbox_2.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic_classes.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
                 from SurfaceMesh.h:17,
                 from export_remesh_delaunay.cpp:7:
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                       ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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) {
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:174:
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/bind.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian_converter.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Filtered_kernel.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:21:
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/property_map.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
                 from SurfaceMesh.h:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/std_thread.h:43,
                 from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/thread:45,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/config.h:428,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20:
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bind/mem_fn.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bind/bind.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multi_index/detail/ord_index_impl.hpp:82,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multi_index/ordered_index.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:37,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:26,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:43,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:61,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_complex_3_in_triangulation_3.h:37,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:24,
                 from export_remesh_delaunay.cpp:11:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/get_pointer.hpp: At global scope:
D:/RCompile/CRANpkg/lib/4.7/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)
      |                                        ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_sequence_adapter.hpp:20,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_vector.hpp:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/mesh_standard_criteria.h:26,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/mesh_standard_facet_criteria.h:29,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_facet_criteria_3.h:24,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_criteria_3.h:28,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:25:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:357:49: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  357 |         explicit reversible_ptr_container( std::auto_ptr<PtrContainer> clone )
      |                                                 ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:383:51: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  383 |         reversible_ptr_container& operator=( std::auto_ptr<PtrContainer> clone ) // nothrow
      |                                                   ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:618:48: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  618 |         iterator insert( iterator before, std::auto_ptr<U> x )
      |                                                ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:689:49: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  689 |         auto_type replace( iterator where, std::auto_ptr<U> x )
      |                                                 ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:717:48: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  717 |         auto_type replace( size_type idx, std::auto_ptr<U> x )
      |                                                ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_sequence_adapter.hpp:223:45: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  223 |         explicit ptr_sequence_adapter( std::auto_ptr<PtrContainer> clone )
      |                                             ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_sequence_adapter.hpp:242:47: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  242 |         ptr_sequence_adapter& operator=( std::auto_ptr<PtrContainer> clone )
      |                                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_sequence_adapter.hpp:271:30: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  271 |         void push_back( std::auto_ptr<U> x )
      |                              ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_sequence_adapter.hpp:294:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |         void push_front( std::auto_ptr<U> x )
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:747:23: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  747 |     explicit PC( std::auto_ptr<this_type> r )       \
      |                       ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:808:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_COPY_AND_ASSIGN_AUTO'
  808 |     BOOST_PTR_CONTAINER_COPY_AND_ASSIGN_AUTO( PC, base_type, this_type )   \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE'
  840 |    BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
      |    ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS'
  843 |     BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type )  \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS'
   64 |         BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:750:25: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  750 |     PC& operator=( std::auto_ptr<this_type> r )     \
      |                         ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:808:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_COPY_AND_ASSIGN_AUTO'
  808 |     BOOST_PTR_CONTAINER_COPY_AND_ASSIGN_AUTO( PC, base_type, this_type )   \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE'
  840 |    BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
      |    ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS'
  843 |     BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type )  \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS'
   64 |         BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:775:10: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  775 |     std::auto_ptr<this_type> release()              \
      |          ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:810:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_RELEASE_AND_CLONE'
  810 |     BOOST_PTR_CONTAINER_RELEASE_AND_CLONE( this_type )                     \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE'
  840 |    BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
      |    ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS'
  843 |     BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type )  \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS'
   64 |         BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:782:10: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  782 |     std::auto_ptr<this_type> clone() const          \
      |          ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:810:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_RELEASE_AND_CLONE'
  810 |     BOOST_PTR_CONTAINER_RELEASE_AND_CLONE( this_type )                     \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE'
  840 |    BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
      |    ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS'
  843 |     BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type )  \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS'
   64 |         BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_vector.hpp: In member function 'std::auto_ptr<boost::ptr_vector<T, CloneAllocator, Allocator> > boost::ptr_vector<T, CloneAllocator, Allocator>::release()':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:777:12: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  777 |       std::auto_ptr<this_type> ptr( new this_type );\
      |            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:810:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_RELEASE_AND_CLONE'
  810 |     BOOST_PTR_CONTAINER_RELEASE_AND_CLONE( this_type )                     \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE'
  840 |    BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
      |    ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS'
  843 |     BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type )  \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS'
   64 |         BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_vector.hpp: In member function 'std::auto_ptr<boost::ptr_vector<T, CloneAllocator, Allocator> > boost::ptr_vector<T, CloneAllocator, Allocator>::clone() const':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:784:20: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  784 |        return std::auto_ptr<this_type>( new this_type( this->begin(), this->end() ) ); \
      |                    ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:810:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_RELEASE_AND_CLONE'
  810 |     BOOST_PTR_CONTAINER_RELEASE_AND_CLONE( this_type )                     \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE'
  840 |    BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
      |    ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS'
  843 |     BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type )  \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro 'BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS'
   64 |         BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/scoped_ptr.hpp:13,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/adjacency_list.hpp:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/split_graph_into_polylines.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polyhedral_mesh_domain_with_features_3.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:27:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/scoped_ptr.hpp:63:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   63 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:165:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<float, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<float> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46:   required from here
   24 |     ResAlignment = traits<Quaternion<float> >::Alignment
      |                                              ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:271:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<float, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<float, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<float> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<float>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3:   required from here
   27 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<double> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47:   required from here
   98 |     ResAlignment = traits<Quaternion<double> >::Alignment
      |                                               ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<double> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<double>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3:   required from here
  102 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/C3T3_helpers.h:29,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/vertex_perturbation.h:25,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Sliver_perturber.h:40,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/perturb_mesh_3.h:25,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/optimize_mesh_3.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:26,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:24,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:28:
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Triangulation_helpers.h: In member function 'bool CGAL::Mesh_3::Triangulation_helpers<Tr>::no_topological_change(Tr&, Vertex_handle, const Vector_3&, const Point&, Cell_vector&) const':
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Triangulation_helpers.h:172: note: '-Wmisleading-indentation' is disabled from this point onwards, since column-tracking was disabled due to the size of the code/headers
  172 |   if(tr.point(v0) == p)
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Triangulation_helpers.h:172: note: adding '-flarge-source-files' will allow for more column-tracking support, at the expense of compilation time and memory
In file included from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/assert.hpp:35,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_complex_3_in_triangulation_3.h:250:55:   required from 'class CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>'
  250 |   typedef typename Edge_map::value_type               Internal_edge;
      |                                                       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:31,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:20:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:129:9:   required from 'struct boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_complex_3_in_triangulation_3.h:250:55:   required from 'class CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>'
  250 |   typedef typename Edge_map::value_type               Internal_edge;
      |                                                       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/int.hpp:20,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda_fwd.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_spec.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/or.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/type_traits.h:16,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Algebraic_structure_traits.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/number_type_basic.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:28:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >::~AssignableConcept()'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept'
  143 |   BOOST_concept(Assignable,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_complex_3_in_triangulation_3.h:250:55:   required from 'class CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>'
  250 |   typedef typename Edge_map::value_type               Internal_edge;
      |                                                       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:132:9:   required from 'struct boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_complex_3_in_triangulation_3.h:250:55:   required from 'class CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>'
  250 |   typedef typename Edge_map::value_type               Internal_edge;
      |                                                       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >::~BinaryFunctionConcept()'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_complex_3_in_triangulation_3.h:250:55:   required from 'class CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>'
  250 |   typedef typename Edge_map::value_type               Internal_edge;
      |                                                       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::set_of_relation<>, boost::bimaps::with_info<int>, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_complex_3_in_triangulation_3.h:250:55:   required from 'class CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>'
  250 |   typedef typename Edge_map::value_type               Internal_edge;
      |                                                       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >; Return = bool; First = CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>; Second = CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  351 |       BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:127:16:   required from 'struct boost::range_detail::IncrementableIteratorConcept<long long unsigned int*>'
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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> >]':
D:/RCompile/CRANpkg/lib/4.7/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>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/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)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/iterator/iterator_concepts.hpp:106:7:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/iterator/iterator_concepts.hpp:106:7:   required from 'struct boost::range_detail::IncrementableIteratorConcept<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13:   required from 'struct boost::range_detail::IncrementableIteratorConcept<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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> >]':
D:/RCompile/CRANpkg/lib/4.7/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>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/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)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:154:13:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:154:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:280:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:280:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:280:9:   required from 'struct boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:127:16:   required from 'struct boost::range_detail::IncrementableIteratorConcept<const long long unsigned int*>'
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13:   required from 'struct boost::range_detail::IncrementableIteratorConcept<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:283:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<const long long unsigned int*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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<const long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:283:9:   required from 'struct boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 = const long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:286:9:   required from 'struct boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = std::array<long long unsigned int, 3>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:286:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  286 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:127:16:   required from 'struct boost::range_detail::IncrementableIteratorConcept<long long unsigned int*>'
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible<TT>::~CopyConstructible() [with TT = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13:   required from 'struct boost::range_detail::IncrementableIteratorConcept<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  138 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 = long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<const long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<const long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:127:16:   required from 'struct boost::range_detail::IncrementableIteratorConcept<const long long unsigned int*>'
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible<TT>::~CopyConstructible() [with TT = const long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<const long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<const long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13:   required from 'struct boost::range_detail::IncrementableIteratorConcept<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 = const long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  138 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<const long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<const long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = const long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<const long long unsigned int*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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<const long long unsigned int*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const long long unsigned int*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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 = const long long unsigned int*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:286:9:   required from 'struct boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::array<long long unsigned int, 3> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long long unsigned int, 3> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
      |                            ~~~~~~~~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/facets_in_complex_3_to_triangle_mesh.h:231:45:   required from 'void CGAL::facets_in_complex_3_to_triangle_mesh(const C3T3&, TriangleMesh&, const NamedParameters&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; TriangleMesh = Surface_mesh<Point_3<Epick> >; NamedParameters = Named_function_parameters<bool, internal_np::all_default_t>]'
  231 |     if (!PMP::is_polygon_soup_a_polygon_mesh(faces))
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:302:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  302 |   CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, out);
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = std::array<long long unsigned int, 3>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:286:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  286 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:129:9:   required from 'struct boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:42:   required from 'class CGAL::Double_map<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<int, double>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, std::less<std::pair<int, double> > >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
      |                                          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Meshes/Double_map_container.h:38:36:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >::~AssignableConcept()'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept'
  143 |   BOOST_concept(Assignable,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:132:9:   required from 'struct boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:42:   required from 'class CGAL::Double_map<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<int, double>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, std::less<std::pair<int, double> > >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
      |                                          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Meshes/Double_map_container.h:38:36:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >::~BinaryFunctionConcept()'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<int, double> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::pair<int, double> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<std::pair<int, double> >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<std::pair<int, double> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<std::pair<int, double> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<std::pair<int, double> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<int, double> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<std::pair<int, double> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:129:9:   required from 'struct boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:42:   required from 'class CGAL::Double_map<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<int, double>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, std::less<std::pair<int, double> > >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
      |                                          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Meshes/Double_map_container.h:38:36:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<std::pair<int, double> >::~AssignableConcept()'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept'
  143 |   BOOST_concept(Assignable,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:132:9:   required from 'struct boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:42:   required from 'class CGAL::Double_map<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<int, double>, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, std::less<std::pair<int, double> > >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
      |                                          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Meshes/Double_map_container.h:38:36:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >::~BinaryFunctionConcept()'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:129:9:   required from 'struct boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, boost::bimaps::multiset_of<int>, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, boost::bimaps::multiset_of<int>, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Refine_facets_manifold_base.h:87:66:   required from 'class CGAL::Mesh_3::Refine_facets_manifold_base<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, CGAL::Mesh_facet_criteria_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, CGAL::Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds> > >, CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>, CGAL::Sequential_tag, CGAL::Meshes::Double_map_container<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<int, double> > >'
   87 |   typedef typename Bad_edges::value_type                         Bad_edge;
      |                                                                  ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Refine_facets_3.h:735:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::~AssignableConcept()'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept'
  143 |   BOOST_concept(Assignable,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:132:9:   required from 'struct boost::bimaps::set_of<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, boost::bimaps::multiset_of<int>, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, boost::bimaps::multiset_of<int>, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Refine_facets_manifold_base.h:87:66:   required from 'class CGAL::Mesh_3::Refine_facets_manifold_base<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, CGAL::Mesh_facet_criteria_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, CGAL::Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds> > >, CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>, CGAL::Sequential_tag, CGAL::Meshes::Double_map_container<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<int, double> > >'
   87 |   typedef typename Bad_edges::value_type                         Bad_edge;
      |                                                                  ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Refine_facets_3.h:735:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::~BinaryFunctionConcept()'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<int>'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:129:9:   required from 'struct boost::bimaps::multiset_of<int>::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<int> >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, boost::bimaps::multiset_of<int>, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, boost::bimaps::multiset_of<int>, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Refine_facets_manifold_base.h:87:66:   required from 'class CGAL::Mesh_3::Refine_facets_manifold_base<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, CGAL::Mesh_facet_criteria_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, CGAL::Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds> > >, CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>, CGAL::Sequential_tag, CGAL::Meshes::Double_map_container<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<int, double> > >'
   87 |   typedef typename Bad_edges::value_type                         Bad_edge;
      |                                                                  ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Refine_facets_3.h:735:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<int>::~AssignableConcept()'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept'
  143 |   BOOST_concept(Assignable,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<int>, bool, int, int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<int>, bool, int, int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<int>, bool, int, int>'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<int>, bool, int, int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<int>, bool, int, int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<int>, bool, int, int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<int>, bool, int, int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<int>, bool, int, int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:132:9:   required from 'struct boost::bimaps::multiset_of<int>::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<int> >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, boost::bimaps::multiset_of<int>, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, boost::bimaps::multiset_of<int>, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Refine_facets_manifold_base.h:87:66:   required from 'class CGAL::Mesh_3::Refine_facets_manifold_base<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, CGAL::Mesh_facet_criteria_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, CGAL::Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds> > >, CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Mesh_complex_3_in_triangulation_3<CGAL::Mesh_3_regular_triangulation_3_wrapper<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Mesh_triangulation_3<CGAL::Polyhedral_mesh_domain_with_features_3<CGAL::Epick, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Default, int, std::integral_constant<bool, true> >, CGAL::Default, CGAL::Sequential_tag, CGAL::Default, CGAL::Default>::Tds>, int, int>, CGAL::Sequential_tag, CGAL::Meshes::Double_map_container<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<int, double> > >'
   87 |   typedef typename Bad_edges::value_type                         Bad_edge;
      |                                                                  ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Refine_facets_3.h:735:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<int>, bool, int, int>::~BinaryFunctionConcept()'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:129:9:   required from 'struct boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:42:   required from 'class CGAL::Double_map<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::pair<int, double>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::less<std::pair<int, double> > >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
      |                                          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Meshes/Double_map_container.h:38:36:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >::~AssignableConcept()'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept'
  143 |   BOOST_concept(Assignable,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:132:9:   required from 'struct boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<std::pair<int, double>, std::less<std::pair<int, double> > >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:42:   required from 'class CGAL::Double_map<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::pair<int, double>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::less<std::pair<int, double> > >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
      |                                          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Meshes/Double_map_container.h:38:36:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >::~BinaryFunctionConcept()'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int> >; Return = bool; First = std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>; Second = std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  351 |       BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<int, double> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<int, double> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::pair<int, double> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<std::pair<int, double> >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<std::pair<int, double> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<std::pair<int, double> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = std::pair<int, double>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::pair<int, double> >, bool, std::pair<int, double>, std::pair<int, double> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<std::pair<int, double> >; Return = bool; First = std::pair<int, double>; Second = std::pair<int, double>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  351 |       BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, bool, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >; Return = bool; First = std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >; Second = std::pair<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Mesh_vertex_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> > > >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  351 |       BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<int>'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<int>, bool, int, int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<int>, bool, int, int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<int>, bool, int, int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<int>, bool, int, int>'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<int>, bool, int, int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<int>, bool, int, int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<int>; Return = bool; First = int; Second = int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  351 |       BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, bool, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >; Return = bool; First = CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>; Second = CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  351 |       BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<double> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<double>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<double>'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<double>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<double> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<double> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<double>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<double>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:129:9:   required from 'struct boost::bimaps::multiset_of<double, std::less<double> >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<double, std::less<double> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:42:   required from 'class CGAL::Double_map<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, double, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::less<double> >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
      |                                          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Slivers_exuder.h:127:0:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<double>::~AssignableConcept()'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept'
  143 |   BOOST_concept(Assignable,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<double>, bool, double, double> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<double>, bool, double, double>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<double>, bool, double, double>'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<double>, bool, double, double>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<double>, bool, double, double> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<double>, bool, double, double> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<double>, bool, double, double>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<double>, bool, double, double>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:132:9:   required from 'struct boost::bimaps::multiset_of<double, std::less<double> >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<double, std::less<double> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> > >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Double_map.h:57:42:   required from 'class CGAL::Double_map<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false>, double, std::less<CGAL::internal::CC_iterator<CGAL::Compact_container<CGAL::Compact_mesh_cell_3<CGAL::Point_3<CGAL::Epick>, CGAL::Weighted_point_3<CGAL::Epick>, int, int, int, CGAL::Triangulation_data_structure_3<CGAL::Mesh_vertex_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, std::tuple<int, int, int, int>, int, CGAL::Regular_triangulation_vertex_base_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, CGAL::Triangulation_ds_vertex_base_3<void> > >, CGAL::Compact_mesh_cell_generator_3<CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >, int, int, int>, CGAL::Sequential_tag> >, CGAL::Default, CGAL::Default, CGAL::Default>, false> >, std::less<double> >'
   57 |   typedef typename Boost_bimap::left_map Direct_func;
      |                                          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Mesh_3/Slivers_exuder.h:127:0:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<double>, bool, double, double>::~BinaryFunctionConcept()'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<double>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<double> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<double>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<double>'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<double>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<double> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = double]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<double>, bool, double, double>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<double>, bool, double, double> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<double>, bool, double, double>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<double>, bool, double, double>'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<double>, bool, double, double>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<double>, bool, double, double> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<double>; Return = bool; First = double; Second = double]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  351 |       BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 9>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 3, 3> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 3, 3>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/PCA_util_Eigen.h:58:10:   required from 'void CGAL::internal::assemble_covariance_matrix_3(InputIterator, InputIterator, typename CGAL::Eigen_diagonalize_traits<typename K::FT, 3>::Covariance_matrix&, const typename K::Point_3&, const K&, const typename K::Triangle_3*, const CGAL::Dimension_tag<2>&, const CGAL::Eigen_diagonalize_traits<typename K::FT, 3>&) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Triangle_3<CGAL::Epick>*, std::vector<CGAL::Triangle_3<CGAL::Epick>, std::allocator<CGAL::Triangle_3<CGAL::Epick> > > >; K = CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >; typename CGAL::Eigen_diagonalize_traits<typename K::FT, 3>::Covariance_matrix = std::array<double, 6>; typename K::FT = double; typename K::Point_3 = CGAL::Point_3<CGAL::Epick>; typename K::Triangle_3 = CGAL::Triangle_3<CGAL::Epick>]'
   58 |   Matrix moment;
      |          ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/PCA_util_Eigen.h:668:32:   required from 'void CGAL::internal::assemble_covariance_matrix_3(InputIterator, InputIterator, typename CGAL::Default_diagonalize_traits<typename K::FT, 3>::Covariance_matrix&, const typename K::Point_3&, const K&, const typename K::Triangle_3*, const CGAL::Dimension_tag<2>&, const CGAL::Default_diagonalize_traits<typename K::FT, 3>&) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Triangle_3<CGAL::Epick>*, std::vector<CGAL::Triangle_3<CGAL::Epick>, std::allocator<CGAL::Triangle_3<CGAL::Epick> > > >; K = CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >; typename CGAL::Default_diagonalize_traits<typename K::FT, 3>::Covariance_matrix = std::array<double, 6>; typename K::FT = double; typename K::Point_3 = CGAL::Point_3<CGAL::Epick>; typename K::Triangle_3 = CGAL::Triangle_3<CGAL::Epick>]'
  668 |   assemble_covariance_matrix_3 (first, beyond, covariance, c, k, t, tag,
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  669 |                                 Eigen_diagonalize_traits<typename K::FT, 3>());
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/linear_least_squares_fitting_triangles_3.h:54:31:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 3, 3> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 3, 3> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::Matrix<double, 3, 3> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::Matrix<double, 3, 3>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::Matrix<double, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::Matrix<double, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::Matrix<double, 3, 3>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::Matrix<double, 3, 3> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/PCA_util_Eigen.h:86:31:   required from 'void CGAL::internal::assemble_covariance_matrix_3(InputIterator, InputIterator, typename CGAL::Eigen_diagonalize_traits<typename K::FT, 3>::Covariance_matrix&, const typename K::Point_3&, const K&, const typename K::Triangle_3*, const CGAL::Dimension_tag<2>&, const CGAL::Eigen_diagonalize_traits<typename K::FT, 3>&) [with InputIterator = __gnu_cxx::__normal_iterator<CGAL::Triangle_3<CGAL::Epick>*, std::vector<CGAL::Triangle_3<CGAL::Epick>, std::allocator<CGAL::Triangle_3<CGAL::Epick> > > >; K = CGAL::Robust_weighted_circumcenter_filtered_traits_3<CGAL::Mesh_3::Robust_intersection_traits_3_new<CGAL::Epick> >; typename CGAL::Eigen_diagonalize_traits<typename K::FT, 3>::Covariance_matrix = std::array<double, 6>; typename K::FT = double; typename K::Point_3 = CGAL::Point_3<CGAL::Epick>; typename K::Triangle_3 = CGAL::Triangle_3<CGAL::Epick>]'
   86 |     transformation = 2 * area * transformation * moment * transformation.transpose();
      |                      ~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/PCA_util_Eigen.h:668:32:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/PCA_util_Eigen.h:86:48:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<Eigen::Matrix<double, 3, 3>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/PCA_util_Eigen.h:86:57:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 3>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 3, 1> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 3, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:149:17:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
  149 |     EigenVector eigenvalues_;
      |                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Default_diagonalize_traits.h:65:59:   required from 'static bool CGAL::Default_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_covariance_matrix(const Covariance_matrix&, Vector&, Matrix&) [with FT = double; unsigned int dim = 3; Covariance_matrix = std::array<double, 6>; Vector = std::array<double, 3>; Matrix = std::array<double, 9>]'
   65 |     return Base::diagonalize_selfadjoint_covariance_matrix(cov, eigenvalues, eigenvectors);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/PCA_util.h:711:5:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 3, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 3, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:92:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 3, 3> >'
   92 |             >::type DiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:97:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 3, 3> >'
   97 |             >::type SubDiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 2>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:97:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 3, 3> >'
   97 |             >::type SubDiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   required from 'class Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >'
  111 |     typedef typename TridiagonalizationType::SubDiagonalType SubDiagonalType;
      |                                                              ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:97:48:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 2, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 2, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 2, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 3, 3>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 3, 3> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:453:34:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&, int) [with InputType = Eigen::Matrix<double, 3, 3>; _MatrixType = Eigen::Matrix<double, 3, 3>]'
  453 |   RealScalar scale = mat.cwiseAbs().maxCoeff();
      |                      ~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:104:26:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3, 1, 3, 3>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3, 1, 3, 3>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3, 1, 3, 3>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 3, 3, 1, 3, 3> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 3, 3, 1, 3, 3> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 3, 1, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:670:23:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:670:31:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:277:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Ref.h:44:50:   required from 'struct Eigen::internal::traits<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >::match<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   44 |       DerivedAlignment = int(evaluator<Derived>::Alignment),
      |                                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Ref.h:288:101:   required by substitution of 'template<class Derived> Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >::Ref(const Eigen::DenseBase<Derived>&, typename Eigen::internal::enable_if<(bool)(Eigen::internal::traits<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >::match<Derived>::MatchAtCompileTime), Derived>::type*) [with Derived = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>]'
  288 |                                  typename internal::enable_if<bool(Traits::template match<Derived>::MatchAtCompileTime),Derived>::type* = 0);
      |                                                                                                     ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:704:25:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  704 |           extract_kernel(tmp, eivecs.col(k), eivecs.col(l));
      |           ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::computeDirect(const MatrixType&, int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; MatrixType = Eigen::Matrix<double, 3, 3>]'
  830 |   internal::direct_selfadjoint_eigenvalues<SelfAdjointEigenSolver,Size,NumTraits<Scalar>::IsComplex>::run(*this,matrix,options);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:101:32:   required from 'static bool CGAL::Eigen_diagonalize_traits<FT, dim>::diagonalize_selfadjoint_matrix(EigenMatrix&, EigenMatrix&, EigenVector&) [with FT = double; unsigned int dim = 3; EigenMatrix = Eigen::Matrix<double, 3, 3>; EigenVector = Eigen::Matrix<double, 3, 1>]'
  101 |       eigensolver.computeDirect(m);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:151:46:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:712:60:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  712 |           eivecs.col(l) -= eivecs.col(k).dot(eivecs.col(l))*eivecs.col(l);
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:731:17:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:398:143:   required from 'Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::TriangularViewType& Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::operator/=(const typename Eigen::internal::traits<T>::Scalar&) [with _MatrixType = Eigen::Matrix<double, 3, 3>; unsigned int _Mode = 1; TriangularViewType = Eigen::TriangularView<Eigen::Matrix<double, 3, 3>, 1>; typename Eigen::internal::traits<T>::Scalar = double]'
  398 |     TriangularViewType&  operator/=(const typename internal::traits<MatrixType>::Scalar& other) { return *this = derived().nestedExpression() / other; }
      |                                                                                                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:455:40:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, -1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 1>'
  223 | template<typename Derived> class MapBase<Derived, WriteAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<Eigen::Matrix<double, 3, 1>, -1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:20:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator*=(const Scalar&) [with Derived = Eigen::Matrix<double, 3, 1>; Scalar = double]'
   20 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:463:14:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&, int) [with InputType = Eigen::Matrix<double, 3, 3>; _MatrixType = Eigen::Matrix<double, 3, 3>]'
  463 |   m_eivalues *= scale;
      |   ~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:104:26:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 3, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 3, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 3, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Array<double, 3, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::Array<double, 3, 1> >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Array<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Array.h:45:7:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:34:67:   required from 'Derived& Eigen::ArrayBase<Derived>::operator-=(const Scalar&) [with Derived = Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >; Scalar = double]'
   34 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::sub_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:670:34:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  670 |     scaledMat.diagonal().array() -= shift;
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:41:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator/=(const Scalar&) [with Derived = Eigen::Matrix<double, 3, 3>; Scalar = double]'
   41 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::div_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:672:29:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  672 |     if(scale > 0) scaledMat /= scale;   // TODO for scale==0 we could save the remaining operations
      |                   ~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:640:28:   required from 'static bool Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::extract_kernel(MatrixType&, Eigen::Ref<typename SolverType::RealVectorType>, Eigen::Ref<typename SolverType::RealVectorType>) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>; typename SolverType::RealVectorType = Eigen::Matrix<double, 3, 1>; typename Eigen::internal::conditional<typename SolverType::RealVectorType::IsVectorAtCompileTime, Eigen::InnerStride<1>, Eigen::OuterStride<> >::type = Eigen::InnerStride<1>]'
  640 |     mat.diagonal().cwiseAbs().maxCoeff(&i0);
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:704:25:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:648:23:   required from 'static bool Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::extract_kernel(MatrixType&, Eigen::Ref<typename SolverType::RealVectorType>, Eigen::Ref<typename SolverType::RealVectorType>) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>; typename SolverType::RealVectorType = Eigen::Matrix<double, 3, 1>; typename Eigen::internal::conditional<typename SolverType::RealVectorType::IsVectorAtCompileTime, Eigen::InnerStride<1>, Eigen::OuterStride<> >::type = Eigen::InnerStride<1>]'
  648 |     if(n0>n1) res = c0/sqrt(n0);
      |                     ~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:704:25:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:846:33:   required from 'static Derived& Eigen::internal::setIdentity_impl<Derived, Big>::run(Derived&) [with Derived = Eigen::Matrix<double, 3, 3>; bool Big = false]'
  846 |     return m = Derived::Identity(m.rows(), m.cols());
      |                ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:875:50:   required from 'Derived& Eigen::MatrixBase<Derived>::setIdentity() [with Derived = Eigen::Matrix<double, 3, 3>]'
  875 |   return internal::setIdentity_impl<Derived>::run(derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:683:27:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Matrix<double, 3, 1>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:646:68:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:44:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>; U = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:147:18:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:475:5:   required from 'void Eigen::internal::apply_rotation_in_the_plane(Eigen::DenseBase<Derived>&, Eigen::DenseBase<Derived>&, const Eigen::JacobiRotation<OtherScalar>&) [with VectorX = Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>; VectorY = Eigen::Block<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >, -1, 1, true>; OtherScalar = double]'
  475 |     EIGEN_PLAIN_ENUM_MIN(evaluator<VectorX>::Alignment, evaluator<VectorY>::Alignment),
      |                                              ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Jacobi/Jacobi.h:315:40:   required from 'void Eigen::MatrixBase<Derived>::applyOnTheRight(Eigen::Index, Eigen::Index, const Eigen::JacobiRotation<OtherScalar>&) [with OtherScalar = double; Derived = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<0, 0> >; Eigen::Index = long long int]'
  315 |   internal::apply_rotation_in_the_plane(x, y, j.transpose());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:895:24:   required from 'void Eigen::internal::tridiagonal_qr_step(RealScalar*, RealScalar*, Index, Index, Scalar*, Index) [with int StorageOrder = 0; RealScalar = double; Scalar = double; Index = long long int]'
  895 |       q.applyOnTheRight(k,k+1,rot);
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:548:87:   required from 'Eigen::ComputationInfo Eigen::internal::computeFromTridiagonal_impl(DiagType&, SubDiagType&, Eigen::Index, bool, MatrixType&) [with MatrixType = Eigen::Matrix<double, 3, 3>; DiagType = Eigen::Matrix<double, 3, 1>; SubDiagType = Eigen::Matrix<double, 2, 1>; Eigen::Index = long long int]'
  548 |     internal::tridiagonal_qr_step<MatrixType::Flags&RowMajorBit ? RowMajor : ColMajor>(diag.data(), subdiag.data(), start, end, computeEigenvectors ? eivec.data() : (Scalar*)0, n);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:460:49:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&, int) [with InputType = Eigen::Matrix<double, 3, 3>; _MatrixType = Eigen::Matrix<double, 3, 3>]'
  460 |   m_info = internal::computeFromTridiagonal_impl(diag, m_subdiag, m_maxIterations, computeEigenvectors, m_eivec);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_diagonalize_traits.h:104:26:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:79:51:   required from 'class Eigen::internal::visitor_evaluator<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false> >'
   79 |     CoeffReadCost = internal::evaluator<XprType>::CoeffReadCost
      |                                                   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:123:17:   required from 'void Eigen::DenseBase<Derived>::visit(Visitor&) const [with Visitor = Eigen::internal::min_coeff_visitor<Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>, 0>; Derived = Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>]'
  123 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Visitor.h:323:14:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::minCoeff(IndexType*) const [with int NaNPropagation = 0; IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  323 |   this->visit(minVisitor);
      |   ~~~~~~~~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:496:37:   required from 'typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::minCoeff(IndexType*) const [with IndexType = long long int; Derived = Eigen::Block<Eigen::Matrix<double, 3, 1>, -1, 1, false>; typename Eigen::internal::traits<T>::Scalar = double]'
  496 |       return minCoeff<PropagateFast>(index);
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:563:35:   required from 'Eigen::ComputationInfo Eigen::internal::computeFromTridiagonal_impl(DiagType&, SubDiagType&, Eigen::Index, bool, MatrixType&) [with MatrixType = Eigen::Matrix<double, 3, 3>; DiagType = Eigen::Matrix<double, 3, 1>; SubDiagType = Eigen::Matrix<double, 2, 1>; Eigen::Index = long long int]'
  563 |       diag.segment(i,n-i).minCoeff(&k);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:460:49:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>, Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 3, 3>, 1, 3, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 35 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:37:   [ skipping 33 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 35 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>; Rhs = Eigen::Transpose<Eigen::Matrix<double, 3, 3> >; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 0>; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Transpose<Eigen::Matrix<double, 3, 3> >; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 32 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 37 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 34 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, Eigen::Matrix<double, 3, 3>, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 36 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:22:   [ skipping 44 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:37:   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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >; Rhs = Eigen::Matrix<double, 3, 3>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Matrix<double, 3, 3>; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |             ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 43 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 3, 3>, 3, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 46 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >; Rhs = Eigen::Matrix<double, 3, 3>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Matrix<double, 3, 3>; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 43 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 48 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::Matrix<double, 3, 3> >, 1, 3, false> >, const Eigen::Block<const Eigen::Matrix<double, 3, 3>, 3, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 45 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/refine_mesh_3.h:301:0:   required from 'void CGAL::refine_mesh_3(C3T3&, const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Exude_options; NP_Tag1 = internal_np::exude_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Perturb_options; NP_Tag2 = internal_np::perturb_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Odt_options, internal_np::odt_options_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Lloyd_options, internal_np::lloyd_options_param_t, internal_np::No_property>, Named_function_parameters<bool, internal_np::do_reset_c3t3_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Mesh_3_options, internal_np::mesh_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Manifold_options, internal_np::manifold_param_t, internal_np::No_property>, Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  301 |   return refine_mesh_3(c3t3, domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:704:0:   required from 'void CGAL::make_mesh_3_impl(C3T3&, const MeshDomain&, const MeshCriteria&, const parameters::internal::Exude_options&, const parameters::internal::Perturb_options&, const parameters::internal::Odt_options&, const parameters::internal::Lloyd_options&, bool, const parameters::internal::Mesh_3_options&, const parameters::internal::Manifold_options&, const parameters::internal::Initialization_options<MeshDomain, C3T3, InitPtsVec>&, const parameters::internal::Surface_options&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; InitPtsVec = std::vector<std::pair<Point_3<Epick>, int>, std::allocator<std::pair<Point_3<Epick>, int> > >]'
  704 |   refine_mesh_3(c3t3, domain, criteria,
  705 |                 parameters::exude_options=exude, parameters::perturb_options=perturb, parameters::odt_options=odt, parameters::lloyd_options= lloyd,
  706 |                 parameters::no_reset_c3t3(), parameters::mesh_options= mesh_options,
  707 |                 parameters::manifold_option= manifold_options,
  708 |                 parameters::surface_only_option = surface_options);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:636:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T = parameters::internal::Surface_options; NP_Tag = internal_np::surface_only_param_t; NP_Base = Named_function_parameters<parameters::internal::Exude_options, internal_np::exude_options_param_t, Named_function_parameters<parameters::internal::Perturb_options, internal_np::perturb_options_param_t, internal_np::No_property> >]'
  636 |     make_mesh_3_impl(c3t3, domain, criteria,
  637 |             exude_param, perturb_param, odt_param, lloyd_param,
  638 |             features_param.features(), mesh_options_param,
  639 |             manifold_options_param,
  640 |             initial_points_gen_param,
  641 |             surface_options_param);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_mesh_3.h:656:0:   required from 'C3T3 CGAL::make_mesh_3(const MeshDomain&, const MeshCriteria&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const Named_function_parameters<NP_T2, NP_Tag2, NP_Base2>&, const NP& ...) [with C3T3 = Mesh_complex_3_in_triangulation_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, int, int>; MeshDomain = Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >; MeshCriteria = Mesh_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_edge_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> >, Mesh_facet_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > >, Mesh_cell_criteria_3<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds>, Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Mesh_3_regular_triangulation_3_wrapper<Robust_weighted_circumcenter_filtered_traits_3<Mesh_3::Robust_intersection_traits_3_new<Epick> >, Mesh_triangulation_3<Polyhedral_mesh_domain_with_features_3<Epick, Surface_mesh<Point_3<Epick> >, Default, int, std::integral_constant<bool, true> >, Default, Sequential_tag, Default, Default>::Tds> > > >; NP_T1 = parameters::internal::Perturb_options; NP_Tag1 = internal_np::perturb_options_param_t; NP_Base1 = internal_np::No_property; NP_T2 = parameters::internal::Exude_options; NP_Tag2 = internal_np::exude_options_param_t; NP_Base2 = internal_np::No_property; NP = {Named_function_parameters<parameters::internal::Surface_options, internal_np::surface_only_param_t, internal_np::No_property>}]'
  656 |   return make_mesh_3<C3T3>(domain, criteria, internal_np::combine_named_parameters(np1, np2, nps...));
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:296:0:   required from 'TriangleMeshOut CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing(const TriangleMesh&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; TriangleMeshOut = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_distance_t, CGAL::Named_function_parameters<double, CGAL::internal_np::mesh_facet_angle_t, CGAL::Named_function_parameters<CGAL::Mesh_constant_domain_field_3<CGAL::Epick, int>, CGAL::internal_np::mesh_edge_size_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::internal_np::No_property> > > > >]'
  296 |   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
  297 |                                       CGAL::parameters::no_perturb(),
  298 |                                       CGAL::parameters::no_exude(),
  299 |                                       CGAL::parameters::surface_only());
export_remesh_delaunay.cpp:45:0:   required from here
   45 |         Mesh3 mesh_tmp = PMP::surface_Delaunay_remeshing(mesh,
   46 |                                                          CGAL::parameters::protect_constraints(true)
   47 |                                                                            .mesh_edge_size(size_edge)
   48 |                                                                            // .mesh_facet_size(size_facet)
   49 |                                                                            .mesh_facet_angle(facetAngle)
   50 |                                                                            .mesh_facet_distance(facetDist)
   51 |                                                                            .edge_is_constrained_map(eif));
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
g++  -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.7/BH/include' -I'D:/RCompile/CRANpkg/lib/4.7/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"   -DCGAL_HEADER_ONLY=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c export_remesh_isotropic.cpp -o export_remesh_isotropic.o
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:205,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dimension.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Bbox_2.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic_classes.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
                 from SurfaceMesh.h:17,
                 from export_remesh_isotropic.cpp:14:
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                       ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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) {
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:174:
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/bind.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian_converter.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Filtered_kernel.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:21:
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/property_map.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
                 from SurfaceMesh.h:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/std_thread.h:43,
                 from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/thread:45,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/config.h:428,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20:
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/scoped_ptr.hpp:13,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/adjacency_list.hpp:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:28,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/selection.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/repair_degeneracies.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:21,
                 from export_remesh_isotropic.cpp:17:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/scoped_ptr.hpp:63:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   63 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bind/mem_fn.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bind/bind.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multi_index/detail/ord_index_impl.hpp:82,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/multi_index/ordered_index.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:37,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:26,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:43,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:61,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap.hpp:13,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:38:
D:/RCompile/CRANpkg/lib/4.7/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)
      |                                        ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:165:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<float, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<float> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46:   required from here
   24 |     ResAlignment = traits<Quaternion<float> >::Alignment
      |                                              ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:271:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<float, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<float, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<float> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<float>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3:   required from here
   27 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<double> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47:   required from here
   98 |     ResAlignment = traits<Quaternion<double> >::Alignment
      |                                               ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<double> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<double>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3:   required from here
  102 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/assert.hpp:35,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:31,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:20:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/int.hpp:20,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda_fwd.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_spec.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/or.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/type_traits.h:16,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Algebraic_structure_traits.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/number_type_basic.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:28:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function 'boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~VertexListGraphConcept()'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro 'BOOST_concept'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from 'struct boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function 'boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~EdgeListGraphConcept()'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro 'BOOST_concept'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function 'boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~IncidenceGraphConcept()'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro 'BOOST_concept'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:960:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::typed_identity_property_map<long long unsigned int>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  182 |     BOOST_CONCEPT_USAGE(VertexListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from 'struct boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:148:7:   required from 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:208:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:148:7:   required from 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::typed_identity_property_map<long long unsigned int>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<CGAL::SM_Halfedge_index> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<CGAL::SM_Halfedge_index>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<CGAL::SM_Halfedge_index>'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<CGAL::SM_Halfedge_index>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::SM_Halfedge_index> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::SM_Halfedge_index> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67:   required from 'void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]'
  639 |       typedef typename Boost_bimap::value_type                    short_edge;
      |                                                                   ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35:   required from 'void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]'
  340 |      remesher.collapse_short_edges(sizing, collapse_constraints);
      |      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29:   required from here
   69 |     PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                              CGAL::parameters::number_of_iterations(nIter)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   71 |                                  .number_of_relaxation_steps(nRelaxSteps)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   72 |                                  .protect_constraints(protectConstraints)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   73 |                                  .edge_is_constrained_map(eif));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<CGAL::SM_Halfedge_index>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<CGAL::SM_Halfedge_index>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:129:9:   required from 'struct boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67:   required from 'void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]'
  639 |       typedef typename Boost_bimap::value_type                    short_edge;
      |                                                                   ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35:   required from 'void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]'
  340 |      remesher.collapse_short_edges(sizing, collapse_constraints);
      |      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29:   required from here
   69 |     PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                              CGAL::parameters::number_of_iterations(nIter)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   71 |                                  .number_of_relaxation_steps(nRelaxSteps)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   72 |                                  .protect_constraints(protectConstraints)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   73 |                                  .edge_is_constrained_map(eif));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<CGAL::SM_Halfedge_index>::~AssignableConcept()'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept'
  143 |   BOOST_concept(Assignable,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67:   required from 'void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]'
  639 |       typedef typename Boost_bimap::value_type                    short_edge;
      |                                                                   ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35:   required from 'void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]'
  340 |      remesher.collapse_short_edges(sizing, collapse_constraints);
      |      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29:   required from here
   69 |     PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                              CGAL::parameters::number_of_iterations(nIter)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   71 |                                  .number_of_relaxation_steps(nRelaxSteps)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   72 |                                  .protect_constraints(protectConstraints)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   73 |                                  .edge_is_constrained_map(eif));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:132:9:   required from 'struct boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67:   required from 'void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]'
  639 |       typedef typename Boost_bimap::value_type                    short_edge;
      |                                                                   ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35:   required from 'void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]'
  340 |      remesher.collapse_short_edges(sizing, collapse_constraints);
      |      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29:   required from here
   69 |     PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                              CGAL::parameters::number_of_iterations(nIter)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   71 |                                  .number_of_relaxation_steps(nRelaxSteps)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   72 |                                  .protect_constraints(protectConstraints)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   73 |                                  .edge_is_constrained_map(eif));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>::~BinaryFunctionConcept()'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<double> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<double>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<double>'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<double>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<double> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<double> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<double, std::less<double> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67:   required from 'void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]'
  639 |       typedef typename Boost_bimap::value_type                    short_edge;
      |                                                                   ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35:   required from 'void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]'
  340 |      remesher.collapse_short_edges(sizing, collapse_constraints);
      |      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29:   required from here
   69 |     PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                              CGAL::parameters::number_of_iterations(nIter)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   71 |                                  .number_of_relaxation_steps(nRelaxSteps)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   72 |                                  .protect_constraints(protectConstraints)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   73 |                                  .edge_is_constrained_map(eif));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<double>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<double>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:129:9:   required from 'struct boost::bimaps::multiset_of<double, std::less<double> >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<double, std::less<double> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67:   required from 'void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]'
  639 |       typedef typename Boost_bimap::value_type                    short_edge;
      |                                                                   ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35:   required from 'void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]'
  340 |      remesher.collapse_short_edges(sizing, collapse_constraints);
      |      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29:   required from here
   69 |     PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                              CGAL::parameters::number_of_iterations(nIter)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   71 |                                  .number_of_relaxation_steps(nRelaxSteps)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   72 |                                  .protect_constraints(protectConstraints)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   73 |                                  .edge_is_constrained_map(eif));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<double>::~AssignableConcept()'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept'
  143 |   BOOST_concept(Assignable,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<double>, bool, double, double> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<double>, bool, double, double>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<double>, bool, double, double>'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<double>, bool, double, double>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<double>, bool, double, double> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<double>, bool, double, double> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<double, std::less<double> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67:   required from 'void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]'
  639 |       typedef typename Boost_bimap::value_type                    short_edge;
      |                                                                   ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35:   required from 'void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]'
  340 |      remesher.collapse_short_edges(sizing, collapse_constraints);
      |      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29:   required from here
   69 |     PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                              CGAL::parameters::number_of_iterations(nIter)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   71 |                                  .number_of_relaxation_steps(nRelaxSteps)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   72 |                                  .protect_constraints(protectConstraints)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   73 |                                  .edge_is_constrained_map(eif));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<double>, bool, double, double>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<double>, bool, double, double>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/set_of.hpp:132:9:   required from 'struct boost::bimaps::multiset_of<double, std::less<double> >::lazy_concept_checked'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<double, std::less<double> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67:   required from 'void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]'
  639 |       typedef typename Boost_bimap::value_type                    short_edge;
      |                                                                   ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35:   required from 'void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]'
  340 |      remesher.collapse_short_edges(sizing, collapse_constraints);
      |      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29:   required from here
   69 |     PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                              CGAL::parameters::number_of_iterations(nIter)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   71 |                                  .number_of_relaxation_steps(nRelaxSteps)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   72 |                                  .protect_constraints(protectConstraints)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   73 |                                  .edge_is_constrained_map(eif));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<double>, bool, double, double>::~BinaryFunctionConcept()'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function 'boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~VertexListGraphConcept()'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro 'BOOST_concept'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from 'struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function 'boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~EdgeListGraphConcept()'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro 'BOOST_concept'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function 'boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~IncidenceGraphConcept()'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro 'BOOST_concept'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, void*>, const boost::detail::edge_desc_impl<boost::directed_tag, void*>&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_reverse_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:960:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, void*>, const boost::detail::edge_desc_impl<boost::directed_tag, void*>&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_reverse_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, boost::vertex_index_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, boost::vertex_index_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:180:7:   required from 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function 'boost::RandomAccessIteratorConcept<std::_Bit_iterator>::~RandomAccessIteratorConcept()'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro 'BOOST_concept'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function 'boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >::~RandomAccessIteratorConcept()'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro 'BOOST_concept'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<CGAL::SM_Halfedge_index>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<CGAL::SM_Halfedge_index> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<CGAL::SM_Halfedge_index>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<CGAL::SM_Halfedge_index>'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<CGAL::SM_Halfedge_index>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<CGAL::SM_Halfedge_index> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67:   required from 'void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]'
  639 |       typedef typename Boost_bimap::value_type                    short_edge;
      |                                                                   ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35:   required from 'void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]'
  340 |      remesher.collapse_short_edges(sizing, collapse_constraints);
      |      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29:   required from here
   69 |     PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                              CGAL::parameters::number_of_iterations(nIter)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   71 |                                  .number_of_relaxation_steps(nRelaxSteps)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   72 |                                  .protect_constraints(protectConstraints)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   73 |                                  .edge_is_constrained_map(eif));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = CGAL::SM_Halfedge_index]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:91:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
   91 |     >::type left_set_type;
      |             ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67:   required from 'void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]'
  639 |       typedef typename Boost_bimap::value_type                    short_edge;
      |                                                                   ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35:   required from 'void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]'
  340 |      remesher.collapse_short_edges(sizing, collapse_constraints);
      |      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29:   required from here
   69 |     PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                              CGAL::parameters::number_of_iterations(nIter)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   71 |                                  .number_of_relaxation_steps(nRelaxSteps)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   72 |                                  .protect_constraints(protectConstraints)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   73 |                                  .edge_is_constrained_map(eif));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<CGAL::SM_Halfedge_index>; Return = bool; First = CGAL::SM_Halfedge_index; Second = CGAL::SM_Halfedge_index]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  351 |       BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<double>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<double> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<double>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:143:3:   required from 'struct boost::AssignableConcept<double>'
  143 |   BOOST_concept(Assignable,(TT))
      |                 ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AssignableConcept<double>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<double> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<double, std::less<double> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67:   required from 'void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]'
  639 |       typedef typename Boost_bimap::value_type                    short_edge;
      |                                                                   ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35:   required from 'void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]'
  340 |      remesher.collapse_short_edges(sizing, collapse_constraints);
      |      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29:   required from here
   69 |     PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                              CGAL::parameters::number_of_iterations(nIter)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   71 |                                  .number_of_relaxation_steps(nRelaxSteps)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   72 |                                  .protect_constraints(protectConstraints)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   73 |                                  .edge_is_constrained_map(eif));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = double]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<double>, bool, double, double>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryFunction<std::less<double>, bool, double, double> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7:   required from 'struct boost::BinaryFunction<std::less<double>, bool, double, double>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:349:3:   required from 'struct boost::BinaryFunctionConcept<std::less<double>, bool, double, double>'
  349 |   BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
      |                 ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryFunctionConcept<std::less<double>, bool, double, double>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<double>, bool, double, double> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13:   required from 'struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<double, std::less<double> > >'
   70 |     >::type type;
      |             ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/detail/bimap_core.hpp:97:13:   required from 'class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
   97 |     >::type right_set_type;
      |             ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/bimap/bimap.hpp:133:7:   required from 'class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>'
  133 | class bimap
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67:   required from 'void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]'
  639 |       typedef typename Boost_bimap::value_type                    short_edge;
      |                                                                   ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35:   required from 'void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]'
  340 |      remesher.collapse_short_edges(sizing, collapse_constraints);
      |      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29:   required from here
   69 |     PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                              CGAL::parameters::number_of_iterations(nIter)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   71 |                                  .number_of_relaxation_steps(nRelaxSteps)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   72 |                                  .protect_constraints(protectConstraints)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   73 |                                  .edge_is_constrained_map(eif));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<double>; Return = bool; First = double; Second = double]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  351 |       BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  182 |     BOOST_CONCEPT_USAGE(VertexListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from 'struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Comparable<TT>::~Comparable() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:603:11:   required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:603:11:   required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 9>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 3, 3> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 3, 3>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:410:40:   required from 'CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<GT> CGAL::Polygon_mesh_processing::internal::principal_curvatures_and_directions_from_anisotropic_measures(std::array<typename GT::FT, 9>, typename GT::FT, typename GT::Vector_3, typename GT::FT) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::FT = double; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>]'
  410 |   Eigen::Matrix<typename GT::FT, 3, 3> v_muXY = Eigen::Matrix<typename GT::FT, 3, 3>::Zero();
      |                                        ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 3, 3> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 3, 3> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:410:91:   required from 'CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<GT> CGAL::Polygon_mesh_processing::internal::principal_curvatures_and_directions_from_anisotropic_measures(std::array<typename GT::FT, 9>, typename GT::FT, typename GT::Vector_3, typename GT::FT) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::FT = double; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>]'
  410 |   Eigen::Matrix<typename GT::FT, 3, 3> v_muXY = Eigen::Matrix<typename GT::FT, 3, 3>::Zero();
      |                                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 3>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 3, 1> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 3, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:417:40:   required from 'CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<GT> CGAL::Polygon_mesh_processing::internal::principal_curvatures_and_directions_from_anisotropic_measures(std::array<typename GT::FT, 9>, typename GT::FT, typename GT::Vector_3, typename GT::FT) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::FT = double; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>]'
  417 |   Eigen::Matrix<typename GT::FT, 3, 1> u(u_GT.x(), u_GT.y(), u_GT.z());
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 3, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 3, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<Eigen::Matrix<double, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<Eigen::Matrix<double, 3, 3>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:421:26:   required from 'CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<GT> CGAL::Polygon_mesh_processing::internal::principal_curvatures_and_directions_from_anisotropic_measures(std::array<typename GT::FT, 9>, typename GT::FT, typename GT::Vector_3, typename GT::FT) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::FT = double; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>]'
  421 |   v_muXY = 0.5 * (v_muXY + v_muXY.transpose()) + K * u * u.transpose();
      |                  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:421:16:   required from 'CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<GT> CGAL::Polygon_mesh_processing::internal::principal_curvatures_and_directions_from_anisotropic_measures(std::array<typename GT::FT, 9>, typename GT::FT, typename GT::Vector_3, typename GT::FT) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::FT = double; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>]'
  421 |   v_muXY = 0.5 * (v_muXY + v_muXY.transpose()) + K * u * u.transpose();
      |            ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:421:52:   required from 'CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<GT> CGAL::Polygon_mesh_processing::internal::principal_curvatures_and_directions_from_anisotropic_measures(std::array<typename GT::FT, 9>, typename GT::FT, typename GT::Vector_3, typename GT::FT) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::FT = double; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>]'
  421 |   v_muXY = 0.5 * (v_muXY + v_muXY.transpose()) + K * u * u.transpose();
      |                                                  ~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<Eigen::Matrix<double, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<Eigen::Matrix<double, 3, 1>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > >, const Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > >, const Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > >, const Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > >, const Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 3>, const Eigen::Transpose<Eigen::Matrix<double, 3, 3> > > >, const Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 0> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:421:48:   required from 'CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<GT> CGAL::Polygon_mesh_processing::internal::principal_curvatures_and_directions_from_anisotropic_measures(std::array<typename GT::FT, 9>, typename GT::FT, typename GT::Vector_3, typename GT::FT) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::FT = double; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>]'
  421 |   v_muXY = 0.5 * (v_muXY + v_muXY.transpose()) + K * u * u.transpose();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:92:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 3, 3> >'
   92 |             >::type DiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:97:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 3, 3> >'
   97 |             >::type SubDiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 2>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<const Eigen::Matrix<double, 3, 3>, -1>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/Tridiagonalization.h:97:21:   required from 'class Eigen::Tridiagonalization<Eigen::Matrix<double, 3, 3> >'
   97 |             >::type SubDiagonalReturnType;
      |                     ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:111:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 2, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 2, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 2, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<void*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<void*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<void*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long long int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:514:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:109:22: note: in a call to non-static member function 'boost::SignedInteger<long long int>::~SignedInteger()'
  109 |   template <> struct SignedInteger< ::boost::long_long_type> {};
      |                      ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:545:11:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:545:11:   required from 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:573:11:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:573:11:   required from 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:603:11:   required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<std::_List_iterator<void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53:   required from 'class Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>'
   63 | template<typename MatrixType, int _DiagIndex> class Diagonal
      |                                                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:670:23:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:670:31:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 3, 3>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, 3, 3> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:671:38:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  671 |     Scalar scale = scaledMat.cwiseAbs().maxCoeff();
      |                    ~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:277:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Ref.h:44:50:   required from 'struct Eigen::internal::traits<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >::match<Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   44 |       DerivedAlignment = int(evaluator<Derived>::Alignment),
      |                                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Ref.h:288:101:   required by substitution of 'template<class Derived> Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >::Ref(const Eigen::DenseBase<Derived>&, typename Eigen::internal::enable_if<(bool)(Eigen::internal::traits<Eigen::Ref<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >::match<Derived>::MatchAtCompileTime), Derived>::type*) [with Derived = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>]'
  288 |                                  typename internal::enable_if<bool(Traits::template match<Derived>::MatchAtCompileTime),Derived>::type* = 0);
      |                                                                                                     ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:704:25:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  704 |           extract_kernel(tmp, eivecs.col(k), eivecs.col(l));
      |           ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   required from 'Eigen::SelfAdjointEigenSolver<MatrixType>& Eigen::SelfAdjointEigenSolver<_MatrixType>::computeDirect(const MatrixType&, int) [with _MatrixType = Eigen::Matrix<double, 3, 3>; MatrixType = Eigen::Matrix<double, 3, 3>]'
  830 |   internal::direct_selfadjoint_eigenvalues<SelfAdjointEigenSolver,Size,NumTraits<Scalar>::IsComplex>::run(*this,matrix,options);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:427:28:   required from 'CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<GT> CGAL::Polygon_mesh_processing::internal::principal_curvatures_and_directions_from_anisotropic_measures(std::array<typename GT::FT, 9>, typename GT::FT, typename GT::Vector_3, typename GT::FT) [with GT = CGAL::Epick; typename GT::FT = double; typename GT::FT = double; typename GT::Vector_3 = CGAL::Vector_3<CGAL::Epick>]'
  427 |   eigensolver.computeDirect(v_muXY);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:712:60:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  712 |           eivecs.col(l) -= eivecs.col(k).dot(eivecs.col(l))*eivecs.col(l);
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<Eigen::Matrix<double, 3, 1> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:731:17:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 3, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 3, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Array<double, 3, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Array<double, 3, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::Array<double, 3, 1> >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Array<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Array.h:45:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:34:67:   required from 'Derived& Eigen::ArrayBase<Derived>::operator-=(const Scalar&) [with Derived = Eigen::ArrayWrapper<Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >; Scalar = double]'
   34 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::sub_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:670:34:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  670 |     scaledMat.diagonal().array() -= shift;
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Diagonal<Eigen::Matrix<double, 3, 3>, 0> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:640:28:   required from 'static bool Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::extract_kernel(MatrixType&, Eigen::Ref<typename SolverType::RealVectorType>, Eigen::Ref<typename SolverType::RealVectorType>) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>; typename SolverType::RealVectorType = Eigen::Matrix<double, 3, 1>; typename Eigen::internal::conditional<typename SolverType::RealVectorType::IsVectorAtCompileTime, Eigen::InnerStride<1>, Eigen::OuterStride<> >::type = Eigen::InnerStride<1>]'
  640 |     mat.diagonal().cwiseAbs().maxCoeff(&i0);
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:704:25:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_quotient_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:648:23:   required from 'static bool Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::extract_kernel(MatrixType&, Eigen::Ref<typename SolverType::RealVectorType>, Eigen::Ref<typename SolverType::RealVectorType>) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>; typename SolverType::RealVectorType = Eigen::Matrix<double, 3, 1>; typename Eigen::internal::conditional<typename SolverType::RealVectorType::IsVectorAtCompileTime, Eigen::InnerStride<1>, Eigen::OuterStride<> >::type = Eigen::InnerStride<1>]'
  648 |     if(n0>n1) res = c0/sqrt(n0);
      |                     ~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:704:25:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:20:67:   required from 'Derived& Eigen::DenseBase<Derived>::operator*=(const Scalar&) [with Derived = Eigen::Matrix<double, 3, 1>; Scalar = double]'
   20 |   internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>());
      |                                              ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:730:12:   required from 'static void Eigen::internal::direct_selfadjoint_eigenvalues<SolverType, 3, false>::run(SolverType&, const MatrixType&, int) [with SolverType = Eigen::SelfAdjointEigenSolver<Eigen::Matrix<double, 3, 3> >; MatrixType = Eigen::Matrix<double, 3, 3>]'
  730 |     eivals *= scale;
      |     ~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:830:106:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_List_iterator<void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:846:33:   required from 'static Derived& Eigen::internal::setIdentity_impl<Derived, Big>::run(Derived&) [with Derived = Eigen::Matrix<double, 3, 3>; bool Big = false]'
  846 |     return m = Derived::Identity(m.rows(), m.cols());
      |                ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:875:50:   required from 'Derived& Eigen::MatrixBase<Derived>::setIdentity() [with Derived = Eigen::Matrix<double, 3, 3>]'
  875 |   return internal::setIdentity_impl<Derived>::run(derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:683:27:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::InnerStride<1> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, 3, 1> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Matrix<double, 3, 1>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h:646:68:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:44:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>; U = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Block<Eigen::Matrix<double, 3, 3>, 3, 1, true>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:147:18:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:409:50:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:22:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:22:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:37:   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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >; Rhs = Eigen::Transpose<Eigen::Matrix<double, 3, 1> >; int ProductTag = 4; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Transpose<Eigen::Matrix<double, 3, 1> >; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |             ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >; Rhs = Eigen::Transpose<Eigen::Matrix<double, 3, 1> >; int ProductTag = 4; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Transpose<Eigen::Matrix<double, 3, 1> >; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<Eigen::Matrix<double, 3, 1> >, 1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:984:158:   required from 'void CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::compute_selected_curvatures() [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  984 |         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
      |                                                                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  985 |           vertex_measures.anisotropic_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                
  986 |           vertex_measures.area_measure,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                                       
  987 |           v_normal,
      |           ~~~~~~~~~                                                                                                                                           
  988 |           avg_edge_length
      |           ~~~~~~~~~~~~~~~                                                                                                                                     
  989 |           );
      |           ~                                                                                                                                                   
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:820:7:   required from 'CGAL::Polygon_mesh_processing::internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>::Interpolated_corrected_curvatures_computer(const PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::ball_radius_t, CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property> >]'
  820 |       compute_selected_curvatures();
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h:1086:13:   required from 'void CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(const PolygonMesh&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = double; NP_Tag = CGAL::internal_np::ball_radius_t; NP_Base = CGAL::Named_function_parameters<CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Principal_curvatures_and_directions<CGAL::Epick> > >, CGAL::internal_np::vertex_principal_curvatures_and_directions_map_t, CGAL::internal_np::No_property>]'
 1086 |   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
      |             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:169:38:   required from 'void CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::calc_sizing_map(FaceGraph&, const NamedParameters&) [with FaceGraph = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  169 |     interpolated_corrected_curvatures(face_graph,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  170 |                                       parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
      |                                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  171 |                                                  .ball_radius(radius));
      |                                                  ~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h:127:22:   required from 'CGAL::Polygon_mesh_processing::Adaptive_sizing_field<PolygonMesh, VPMap>::Adaptive_sizing_field(FT, const std::pair<typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT, typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT>&, const FaceRange&, PolygonMesh&, const NamedParameters&) [with FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; NamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VPMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; FT = double; typename CGAL::Polygon_mesh_processing::internal::Sizing_field_base<PolygonMesh, VPMap>::FT = double]'
  127 |       calc_sizing_map(pmesh, np);
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~
export_remesh_isotropic.cpp:111:13:   required from here
  111 |         mesh);
      |             ^
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
g++  -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.7/BH/include' -I'D:/RCompile/CRANpkg/lib/4.7/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"   -DCGAL_HEADER_ONLY=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c export_remesh_simplify.cpp -o export_remesh_simplify.o
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:205,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dimension.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Bbox_2.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic_classes.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
                 from SurfaceMesh.h:17,
                 from export_remesh_simplify.cpp:7:
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                       ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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) {
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:174:
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/bind.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian_converter.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Filtered_kernel.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:21:
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/property_map.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
                 from SurfaceMesh.h:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/std_thread.h:43,
                 from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/thread:45,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/config.h:428,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20:
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/scoped_ptr.hpp:13,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/adjacency_list.hpp:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Common.h:27,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:20,
                 from export_remesh_simplify.cpp:11:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/scoped_ptr.hpp:63:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   63 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:165:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<float, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<float> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46:   required from here
   24 |     ResAlignment = traits<Quaternion<float> >::Alignment
      |                                              ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:271:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<float, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<float, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<float> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<float>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3:   required from here
   27 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<double> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47:   required from here
   98 |     ResAlignment = traits<Quaternion<double> >::Alignment
      |                                               ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<double> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<double>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3:   required from here
  102 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 16>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 4, 4, 2, 4, 4> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 4, 4, 2, 4, 4> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 4, 4, 2, 4, 4>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Properties.h:212:17:   required from 'class CGAL::Properties::Property_array<Eigen::Matrix<double, 4, 4, 2, 4, 4> >'
  212 |     value_type  value_;
      |                 ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Properties.h:532:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dynamic_property_map.h:96:33:   required from 'struct CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Eigen::Matrix<double, 4, 4, 2, 4, 4> > >'
   96 |   typedef typename PM::key_type key_type;
      |                                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h:63:19:   required from 'struct CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_quadrics_storage<CGAL::Surface_mesh_simplification::internal::Plane_quadric_calculator<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>'
   63 |   Vertex_cost_map m_cost_matrices;
      |                   ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h:81:7:   required from 'class CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_cost_and_placement<CGAL::Surface_mesh_simplification::internal::Plane_quadric_calculator<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>'
   81 | class GarlandHeckbert_cost_and_placement
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_plane_policies.h:93:7:   required from 'class CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>'
   93 | class GarlandHeckbert_plane_policies
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:111:9:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  111 |   using GH_cost      = typename GHPolicies::Get_cost;
      |         ^~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 4, 4, 2, 4, 4> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 4, 4, 2, 4, 4> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 4, 4, 2, 4, 4> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dynamic_property_map.h:96:33:   required from 'struct CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, Eigen::Matrix<double, 4, 4, 2, 4, 4> > >'
   96 |   typedef typename PM::key_type key_type;
      |                                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h:63:19:   required from 'struct CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_quadrics_storage<CGAL::Surface_mesh_simplification::internal::Plane_quadric_calculator<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>'
   63 |   Vertex_cost_map m_cost_matrices;
      |                   ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h:81:7:   required from 'class CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_cost_and_placement<CGAL::Surface_mesh_simplification::internal::Plane_quadric_calculator<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>'
   81 | class GarlandHeckbert_cost_and_placement
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_plane_policies.h:93:7:   required from 'class CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>'
   93 | class GarlandHeckbert_plane_policies
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:111:9:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  111 |   using GH_cost      = typename GHPolicies::Get_cost;
      |         ^~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 4, 4> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 4, 4> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h:71:80:   required from 'CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_quadrics_storage<QuadricCalculator, TriangleMesh, GeomTraits>::GarlandHeckbert_quadrics_storage(TriangleMesh&, const Quadric_calculator&) [with QuadricCalculator = CGAL::Surface_mesh_simplification::internal::Plane_quadric_calculator<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; Quadric_calculator = CGAL::Surface_mesh_simplification::internal::Plane_quadric_calculator<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>]'
   71 |     : m_cost_matrices(get(Cost_property(), tmesh, Cost_matrix(Cost_matrix::Zero()))),
      |                                                               ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h:111:67:   required from 'CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_cost_and_placement<QuadricCalculator, TriangleMesh, GeomTraits>::GarlandHeckbert_cost_and_placement(TriangleMesh&, const Quadric_calculator&, FT) [with QuadricCalculator = CGAL::Surface_mesh_simplification::internal::Plane_quadric_calculator<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; Quadric_calculator = CGAL::Surface_mesh_simplification::internal::Plane_quadric_calculator<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; FT = double]'
  111 |     : Base(tmesh, quadric_calculator), discontinuity_multiplier(dm)
      |                                                                   ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_plane_policies.h:114:43:   required from 'CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<TriangleMesh, GeomTraits>::GarlandHeckbert_plane_policies(TriangleMesh&, FT) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; FT = double]'
  114 |     : Base(tmesh, Quadric_calculator(), dm)
      |                                           ^
export_remesh_simplify.cpp:115:14:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  115 |   GHPolicies gh_policies(mesh);
      |              ^~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 4, 4> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4> >, const Eigen::Matrix<double, 4, 4, 2, 4, 4> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4> >, const Eigen::Matrix<double, 4, 4, 2, 4, 4>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4> >, const Eigen::Matrix<double, 4, 4, 2, 4, 4> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4> >, const Eigen::Matrix<double, 4, 4, 2, 4, 4> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4> >, const Eigen::Matrix<double, 4, 4, 2, 4, 4> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4> >, const Eigen::Matrix<double, 4, 4, 2, 4, 4>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4> >, const Eigen::Matrix<double, 4, 4, 2, 4, 4> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h:193:36:   required from 'void CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_cost_and_placement<QuadricCalculator, TriangleMesh, GeomTraits>::initialize(const TriangleMesh&, VertexPointMap, const GeomTraits&) const [with VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; QuadricCalculator = CGAL::Surface_mesh_simplification::internal::Plane_quadric_calculator<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick]'
  193 |           discontinuity_multiplier * construct_quadric(shd, tmesh, vpm, gt);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 4, 2, 4, 4>, const Eigen::Matrix<double, 4, 4, 2, 4, 4> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 4, 2, 4, 4>, const Eigen::Matrix<double, 4, 4, 2, 4, 4> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 4, 2, 4, 4>, const Eigen::Matrix<double, 4, 4, 2, 4, 4> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 4, 2, 4, 4>, const Eigen::Matrix<double, 4, 4, 2, 4, 4>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 4, 2, 4, 4>, const Eigen::Matrix<double, 4, 4, 2, 4, 4> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h:34:12:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Matrix<double, 4, 1>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h:227:43:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:513:21:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::collect() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  513 |       data.cost() = cost(profile);
      |                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:464:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  464 |   collect();
      |   ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h:227:46:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:513:21:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::collect() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  513 |       data.cost() = cost(profile);
      |                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:464:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  464 |   collect();
      |   ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0>, Eigen::Matrix<double, 4, 1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0>, Eigen::Matrix<double, 4, 1>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0>, Eigen::Matrix<double, 4, 1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:126:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0>, Eigen::Matrix<double, 4, 1>, 0, 6>'
  126 | class dense_product_base<Lhs, Rhs, Option, InnerProduct>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0>, Eigen::Matrix<double, 4, 1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0>, Eigen::Matrix<double, 4, 1>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h:227:64:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:513:21:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::collect() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  513 |       data.cost() = cost(profile);
      |                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:464:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  464 |   collect();
      |   ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0>, Eigen::Matrix<double, 4, 1>, 0> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0>, Eigen::Matrix<double, 4, 1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:126:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0>, Eigen::Matrix<double, 4, 1>, 0, 6>'
  126 | class dense_product_base<Lhs, Rhs, Option, InnerProduct>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0>, Eigen::Matrix<double, 4, 1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0>, Eigen::Matrix<double, 4, 1>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h:227:64:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:513:21:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::collect() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  513 |       data.cost() = cost(profile);
      |                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:464:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  464 |   collect();
      |   ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 4>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 4>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 4>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 4, 4> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 4, 4> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 4, 4> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_composed_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_line_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Vector_3<CGAL::Epick> > > >, true>, CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_composed_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_line_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Vector_3<CGAL::Epick> > > >, true>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_composed_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_line_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Vector_3<CGAL::Epick> > > >, true>; GetPlacement_ = CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_composed_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_line_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Vector_3<CGAL::Epick> > > >, true>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = GarlandHeckbert_composed_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, GarlandHeckbert_line_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Vector_3<CGAL::Epick> > > >, true>; GetPlacement = GarlandHeckbert_composed_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, GarlandHeckbert_line_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Vector_3<CGAL::Epick> > > >, true>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<internal::GarlandHeckbert_composed_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, internal::GarlandHeckbert_line_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Vector_3<CGAL::Epick> > > >, true>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<internal::GarlandHeckbert_composed_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, internal::GarlandHeckbert_line_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Vector_3<CGAL::Epick> > > >, true>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_and_line_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:168:43:   required from here
  168 |     r = collapse_gh<Plane_and_line, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 4, 4> >, const Eigen::Matrix<double, 4, 4, 2, 4, 4> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 4, 4> >, const Eigen::Matrix<double, 4, 4, 2, 4, 4> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 4, 4> >, const Eigen::Matrix<double, 4, 4, 2, 4, 4> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 4, 4> >, const Eigen::Matrix<double, 4, 4, 2, 4, 4> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 4, 4> >, const Eigen::Matrix<double, 4, 4, 2, 4, 4> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 4, 4> >, const Eigen::Matrix<double, 4, 4, 2, 4, 4> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 4, 4> >, const Eigen::Matrix<double, 4, 4, 2, 4, 4> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 4, 4> >, const Eigen::Matrix<double, 4, 4, 2, 4, 4> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 4, 4> >, const Eigen::Matrix<double, 4, 4, 2, 4, 4> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 4, 4> >, const Eigen::Matrix<double, 4, 4, 2, 4, 4> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_composed_policies.h:57:99:   required from 'CGAL::Surface_mesh_simplification::internal::Composed_quadric_calculator<TriangleMesh, GeomTraits, Quadric_calculator_1, Quadric_calculator_2, invertible>::Mat_4 CGAL::Surface_mesh_simplification::internal::Composed_quadric_calculator<TriangleMesh, GeomTraits, Quadric_calculator_1, Quadric_calculator_2, invertible>::construct_quadric_from_vertex(typename boost::graph_traits<Graph>::vertex_descriptor, const TriangleMesh&, VertexPointMap, const GeomTraits&) const [with VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; Quadric_calculator_1 = CGAL::Surface_mesh_simplification::internal::Plane_quadric_calculator<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; Quadric_calculator_2 = CGAL::Surface_mesh_simplification::internal::Line_quadric_calculator<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; bool invertible = true; Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename boost::graph_traits<Graph>::vertex_descriptor = CGAL::SM_Vertex_index]'
   57 |     return weight_1 * quadric_calculator_1.construct_quadric_from_vertex(v, tmesh, point_map, gt) +
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
   58 |            weight_2 * quadric_calculator_2.construct_quadric_from_vertex(v, tmesh, point_map, gt);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h:141:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_composed_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_line_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Vector_3<CGAL::Epick> > > >, true>, CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_composed_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_line_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Vector_3<CGAL::Epick> > > >, true>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_composed_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_line_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Vector_3<CGAL::Epick> > > >, true>; GetPlacement_ = CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_composed_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_line_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Vector_3<CGAL::Epick> > > >, true>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = GarlandHeckbert_composed_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, GarlandHeckbert_line_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Vector_3<CGAL::Epick> > > >, true>; GetPlacement = GarlandHeckbert_composed_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, GarlandHeckbert_line_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Vector_3<CGAL::Epick> > > >, true>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<internal::GarlandHeckbert_composed_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, internal::GarlandHeckbert_line_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Vector_3<CGAL::Epick> > > >, true>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<internal::GarlandHeckbert_composed_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, internal::GarlandHeckbert_line_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::internal::Dynamic<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Vector_3<CGAL::Epick> > > >, true>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_and_line_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:168:43:   required from here
  168 |     r = collapse_gh<Plane_and_line, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, 1, 0, 1, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:167:44:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:513:21:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::collect() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  513 |       data.cost() = cost(profile);
      |                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:464:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  464 |   collect();
      |   ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, 4>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, 4>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, 4>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 1, 4> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 1, 4> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 1, 4> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:162:40:   required from here
  162 |     r = collapse_gh<Classic_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 1, 4> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 1, 4> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Matrix<double, 1, 4> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<Eigen::Matrix<double, 1, 4> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<Eigen::Matrix<double, 1, 4> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<Eigen::Matrix<double, 1, 4>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:162:40:   required from here
  162 |     r = collapse_gh<Classic_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<Eigen::Matrix<double, 1, 4> >, Eigen::Matrix<double, 1, 4>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<Eigen::Matrix<double, 1, 4> >, Eigen::Matrix<double, 1, 4>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<Eigen::Matrix<double, 1, 4> >, Eigen::Matrix<double, 1, 4>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<Eigen::Matrix<double, 1, 4> >, Eigen::Matrix<double, 1, 4>, 0, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<Eigen::Matrix<double, 1, 4> >, Eigen::Matrix<double, 1, 4>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Transpose<Eigen::Matrix<double, 1, 4> >, Eigen::Matrix<double, 1, 4>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:400:26:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:162:40:   required from here
  162 |     r = collapse_gh<Classic_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 3>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 3, 1> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 3, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:426:15:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 CGAL::Surface_mesh_simplification::internal::construct_prob_plane_quadric_from_normal(const typename GeomTraits::Vector_3&, const typename GeomTraits::Point_3&, const GeomTraits&, typename GeomTraits::FT, typename GeomTraits::FT) [with GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename GeomTraits::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GeomTraits::Point_3 = CGAL::Point_3<CGAL::Epick>; typename GeomTraits::FT = double]'
  426 |   const Col_3 mean_n_col { mean_normal.x(), mean_normal.y(), mean_normal.z() };
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_probabilistic_plane_policies.h:121:52:   required from 'CGAL::Surface_mesh_simplification::internal::Probabilistic_plane_quadric_calculator<TriangleMesh, GeomTraits, FaceVarianceMap>::Mat_4 CGAL::Surface_mesh_simplification::internal::Probabilistic_plane_quadric_calculator<TriangleMesh, GeomTraits, FaceVarianceMap>::construct_quadric_from_face(face_descriptor, const TriangleMesh&, VertexPointMap, const GeomTraits&) const [with VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; FaceVarianceMap = CGAL::Default; Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; face_descriptor = CGAL::SM_Face_index]'
  121 |     return construct_prob_plane_quadric_from_normal(normal, p, gt, n_variance, p_variance);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h:159:60:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 3, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 3, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 4, 4> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 4, 4> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 4, 4> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 4, 4> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:429:40:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 CGAL::Surface_mesh_simplification::internal::construct_prob_plane_quadric_from_normal(const typename GeomTraits::Vector_3&, const typename GeomTraits::Point_3&, const GeomTraits&, typename GeomTraits::FT, typename GeomTraits::FT) [with GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename GeomTraits::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GeomTraits::Point_3 = CGAL::Point_3<CGAL::Epick>; typename GeomTraits::FT = double]'
  429 |   Mat_4 mat = face_nv * Mat_4::Identity();
      |                         ~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_probabilistic_plane_policies.h:121:52:   required from 'CGAL::Surface_mesh_simplification::internal::Probabilistic_plane_quadric_calculator<TriangleMesh, GeomTraits, FaceVarianceMap>::Mat_4 CGAL::Surface_mesh_simplification::internal::Probabilistic_plane_quadric_calculator<TriangleMesh, GeomTraits, FaceVarianceMap>::construct_quadric_from_face(face_descriptor, const TriangleMesh&, VertexPointMap, const GeomTraits&) const [with VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; FaceVarianceMap = CGAL::Default; Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; face_descriptor = CGAL::SM_Face_index]'
  121 |     return construct_prob_plane_quadric_from_normal(normal, p, gt, n_variance, p_variance);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h:159:60:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4> >, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 4, 4> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4> >, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 4, 4> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4> >, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 4, 4> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4> >, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 4, 4> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4> >, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 4, 4> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:429:23:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 CGAL::Surface_mesh_simplification::internal::construct_prob_plane_quadric_from_normal(const typename GeomTraits::Vector_3&, const typename GeomTraits::Point_3&, const GeomTraits&, typename GeomTraits::FT, typename GeomTraits::FT) [with GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename GeomTraits::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GeomTraits::Point_3 = CGAL::Point_3<CGAL::Epick>; typename GeomTraits::FT = double]'
  429 |   Mat_4 mat = face_nv * Mat_4::Identity();
      |               ~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_probabilistic_plane_policies.h:121:52:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, -1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false>, 1>'
  223 | template<typename Derived> class MapBase<Derived, WriteAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Matrix<double, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Matrix<double, 3, 1>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:432:61:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Matrix<double, 3, 1>, Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Matrix<double, 3, 1>, Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Matrix<double, 3, 1>, Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Matrix<double, 3, 1>, Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 0, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Matrix<double, 3, 1>, Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Matrix<double, 3, 1>, Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:432:39:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 9>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Matrix<double, 3, 1>, Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 0> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Matrix<double, 3, 1>, Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Matrix<double, 3, 1>, Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 0, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Matrix<double, 3, 1>, Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Matrix<double, 3, 1>, Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:432:39:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, -1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, -1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, -1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, -1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, -1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Matrix<double, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_opposite_op<double>, const Eigen::Matrix<double, 3, 1>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Matrix<double, 3, 1> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:440:24:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 CGAL::Surface_mesh_simplification::internal::construct_prob_plane_quadric_from_normal(const typename GeomTraits::Vector_3&, const typename GeomTraits::Point_3&, const GeomTraits&, typename GeomTraits::FT, typename GeomTraits::FT) [with GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename GeomTraits::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GeomTraits::Point_3 = CGAL::Point_3<CGAL::Epick>; typename GeomTraits::FT = double]'
  440 |   mat.col(3).head(3) = - b;
      |                        ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_probabilistic_plane_policies.h:121:52:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 1, -1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 1, -1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_opposite_op<double>, const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> > >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:441:24:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 CGAL::Surface_mesh_simplification::internal::construct_prob_plane_quadric_from_normal(const typename GeomTraits::Vector_3&, const typename GeomTraits::Point_3&, const GeomTraits&, typename GeomTraits::FT, typename GeomTraits::FT) [with GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename GeomTraits::Vector_3 = CGAL::Vector_3<CGAL::Epick>; typename GeomTraits::Point_3 = CGAL::Point_3<CGAL::Epick>; typename GeomTraits::FT = double]'
  441 |   mat.row(3).head(3) = - b.transpose();
      |                        ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_probabilistic_plane_policies.h:121:52:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3, 2, 3, 3>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3, 2, 3, 3>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 3, 3, 2, 3, 3> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 3, 3, 2, 3, 3> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 3, 2, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:501:38:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:501:21:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:501:41:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 CGAL::Surface_mesh_simplification::internal::construct_prob_triangle_quadric_from_face(typename boost::graph_traits<Graph>::face_descriptor, typename GeomTraits::FT, const TriangleMesh&, VertexPointMap, const GeomTraits&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename boost::graph_traits<Graph>::face_descriptor = CGAL::SM_Face_index; typename GeomTraits::FT = double]'
  501 |   A += var * (cp_ab * cp_ab.transpose() + cp_bc * cp_bc.transpose() + cp_ca * cp_ca.transpose());
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_probabilistic_triangle_policies.h:113:53:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:501:69:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 CGAL::Surface_mesh_simplification::internal::construct_prob_triangle_quadric_from_face(typename boost::graph_traits<Graph>::face_descriptor, typename GeomTraits::FT, const TriangleMesh&, VertexPointMap, const GeomTraits&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename boost::graph_traits<Graph>::face_descriptor = CGAL::SM_Face_index; typename GeomTraits::FT = double]'
  501 |   A += var * (cp_ab * cp_ab.transpose() + cp_bc * cp_bc.transpose() + cp_ca * cp_ca.transpose());
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_probabilistic_triangle_policies.h:113:53:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0>, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> >, const Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 0> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:501:12:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 CGAL::Surface_mesh_simplification::internal::construct_prob_triangle_quadric_from_face(typename boost::graph_traits<Graph>::face_descriptor, typename GeomTraits::FT, const TriangleMesh&, VertexPointMap, const GeomTraits&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename boost::graph_traits<Graph>::face_descriptor = CGAL::SM_Face_index; typename GeomTraits::FT = double]'
  501 |   A += var * (cp_ab * cp_ab.transpose() + cp_bc * cp_bc.transpose() + cp_ca * cp_ca.transpose());
      |        ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_probabilistic_triangle_policies.h:113:53:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 3, 3> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 3, 3> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:504:41:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 CGAL::Surface_mesh_simplification::internal::construct_prob_triangle_quadric_from_face(typename boost::graph_traits<Graph>::face_descriptor, typename GeomTraits::FT, const TriangleMesh&, VertexPointMap, const GeomTraits&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename boost::graph_traits<Graph>::face_descriptor = CGAL::SM_Face_index; typename GeomTraits::FT = double]'
  504 |   A += 6 * square(var) * Mat_3::Identity();
      |                          ~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_probabilistic_triangle_policies.h:113:53:   required from 'CGAL::Surface_mesh_simplification::internal::Probabilistic_triangle_quadric_calculator<TriangleMesh, GeomTraits, FaceVarianceMap>::Mat_4 CGAL::Surface_mesh_simplification::internal::Probabilistic_triangle_quadric_calculator<TriangleMesh, GeomTraits, FaceVarianceMap>::construct_quadric_from_face(typename boost::graph_traits<Graph>::face_descriptor, const TriangleMesh&, VertexPointMap, const GeomTraits&) const [with VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; FaceVarianceMap = CGAL::Default; Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename boost::graph_traits<Graph>::face_descriptor = CGAL::SM_Face_index]'
  113 |     return construct_prob_triangle_quadric_from_face(f, variance, tmesh, point_map, gt);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h:159:60:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 3> >, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_identity_op<double>, Eigen::Matrix<double, 3, 3> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:504:24:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 CGAL::Surface_mesh_simplification::internal::construct_prob_triangle_quadric_from_face(typename boost::graph_traits<Graph>::face_descriptor, typename GeomTraits::FT, const TriangleMesh&, VertexPointMap, const GeomTraits&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename boost::graph_traits<Graph>::face_descriptor = CGAL::SM_Face_index; typename GeomTraits::FT = double]'
  504 |   A += 6 * square(var) * Mat_3::Identity();
      |        ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_probabilistic_triangle_policies.h:113:53:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::Matrix<double, 3, 1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:511:27:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 CGAL::Surface_mesh_simplification::internal::construct_prob_triangle_quadric_from_face(typename boost::graph_traits<Graph>::face_descriptor, typename GeomTraits::FT, const TriangleMesh&, VertexPointMap, const GeomTraits&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename boost::graph_traits<Graph>::face_descriptor = CGAL::SM_Face_index; typename GeomTraits::FT = double]'
  511 |   const Col_3 res_b = det * sum_cp_col - var * (vector_to_col_3<GeomTraits>(cross_product(a_minus_b, ab))
      |                       ~~~~^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_probabilistic_triangle_policies.h:113:53:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:512:49:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 CGAL::Surface_mesh_simplification::internal::construct_prob_triangle_quadric_from_face(typename boost::graph_traits<Graph>::face_descriptor, typename GeomTraits::FT, const TriangleMesh&, VertexPointMap, const GeomTraits&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename boost::graph_traits<Graph>::face_descriptor = CGAL::SM_Face_index; typename GeomTraits::FT = double]'
  511 |   const Col_3 res_b = det * sum_cp_col - var * (vector_to_col_3<GeomTraits>(cross_product(a_minus_b, ab))
      |                                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                                 + vector_to_col_3<GeomTraits>(cross_product(b_minus_c, bc))
      |                                                 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_probabilistic_triangle_policies.h:113:53:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:513:49:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 CGAL::Surface_mesh_simplification::internal::construct_prob_triangle_quadric_from_face(typename boost::graph_traits<Graph>::face_descriptor, typename GeomTraits::FT, const TriangleMesh&, VertexPointMap, const GeomTraits&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename boost::graph_traits<Graph>::face_descriptor = CGAL::SM_Face_index; typename GeomTraits::FT = double]'
  511 |   const Col_3 res_b = det * sum_cp_col - var * (vector_to_col_3<GeomTraits>(cross_product(a_minus_b, ab))
      |                                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                                 + vector_to_col_3<GeomTraits>(cross_product(b_minus_c, bc))
      |                                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                                 + vector_to_col_3<GeomTraits>(cross_product(c_minus_a, ca)))
      |                                                 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_probabilistic_triangle_policies.h:113:53:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:511:46:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 CGAL::Surface_mesh_simplification::internal::construct_prob_triangle_quadric_from_face(typename boost::graph_traits<Graph>::face_descriptor, typename GeomTraits::FT, const TriangleMesh&, VertexPointMap, const GeomTraits&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename boost::graph_traits<Graph>::face_descriptor = CGAL::SM_Face_index; typename GeomTraits::FT = double]'
  511 |   const Col_3 res_b = det * sum_cp_col - var * (vector_to_col_3<GeomTraits>(cross_product(a_minus_b, ab))
      |                                          ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                                 + vector_to_col_3<GeomTraits>(cross_product(b_minus_c, bc))
      |                                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                                 + vector_to_col_3<GeomTraits>(cross_product(c_minus_a, ca)))
      |                                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_probabilistic_triangle_policies.h:113:53:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_difference_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:511:40:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 CGAL::Surface_mesh_simplification::internal::construct_prob_triangle_quadric_from_face(typename boost::graph_traits<Graph>::face_descriptor, typename GeomTraits::FT, const TriangleMesh&, VertexPointMap, const GeomTraits&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename boost::graph_traits<Graph>::face_descriptor = CGAL::SM_Face_index; typename GeomTraits::FT = double]'
  511 |   const Col_3 res_b = det * sum_cp_col - var * (vector_to_col_3<GeomTraits>(cross_product(a_minus_b, ab))
      |                       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                                 + vector_to_col_3<GeomTraits>(cross_product(b_minus_c, bc))
      |                                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                                 + vector_to_col_3<GeomTraits>(cross_product(c_minus_a, ca)))
      |                                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_probabilistic_triangle_policies.h:113:53:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > > >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > > >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > > >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > > >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 3, 1>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > > >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 3, 1> >, const Eigen::Matrix<double, 3, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:514:23:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 CGAL::Surface_mesh_simplification::internal::construct_prob_triangle_quadric_from_face(typename boost::graph_traits<Graph>::face_descriptor, typename GeomTraits::FT, const TriangleMesh&, VertexPointMap, const GeomTraits&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename boost::graph_traits<Graph>::face_descriptor = CGAL::SM_Face_index; typename GeomTraits::FT = double]'
  511 |   const Col_3 res_b = det * sum_cp_col - var * (vector_to_col_3<GeomTraits>(cross_product(a_minus_b, ab))
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                                 + vector_to_col_3<GeomTraits>(cross_product(b_minus_c, bc))
      |                                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                                 + vector_to_col_3<GeomTraits>(cross_product(c_minus_a, ca)))
      |                                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  514 |                       + 2 * square(var) * vector_to_col_3<GeomTraits>(sum_vectors(sum_vectors(a, b), c));
      |                       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_probabilistic_triangle_policies.h:113:53:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:647:36:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::loop() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  647 |         Placement_type placement = get_placement(profile);
      |                                    ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:467:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  467 |   loop();
      |   ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:246:28:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Col_4 CGAL::Surface_mesh_simplification::internal::construct_optimal_point_singular(const typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4&, const typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4&, const typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4&) [with GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4 = Eigen::Matrix<double, 4, 1>; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4 = Eigen::Matrix<double, 4, 1>]'
  246 |     const Col_4 p1mp0 = p1 - p0;
      |                         ~~~^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_plane_policies.h:86:56:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:647:36:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::loop() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  647 |         Placement_type placement = get_placement(profile);
      |                                    ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:467:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  467 |   loop();
      |   ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:255:28:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Col_4 CGAL::Surface_mesh_simplification::internal::construct_optimal_point_singular(const typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4&, const typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4&, const typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4&) [with GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4 = Eigen::Matrix<double, 4, 1>; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4 = Eigen::Matrix<double, 4, 1>]'
  255 |         opt_pt = 0.5 * (p0 + p1);
      |                        ~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_plane_policies.h:86:56:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:647:36:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::loop() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  647 |         Placement_type placement = get_placement(profile);
      |                                    ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:467:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  467 |   loop();
      |   ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 4, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7:   required from 'class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 4, 1> >'
   60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> > > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:647:36:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::loop() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  647 |         Placement_type placement = get_placement(profile);
      |                                    ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:467:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  467 |   loop();
      |   ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 4, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:255:22:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Col_4 CGAL::Surface_mesh_simplification::internal::construct_optimal_point_singular(const typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4&, const typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4&, const typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4&) [with GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4 = Eigen::Matrix<double, 4, 1>; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4 = Eigen::Matrix<double, 4, 1>]'
  255 |         opt_pt = 0.5 * (p0 + p1);
      |                  ~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_plane_policies.h:86:56:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:647:36:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::loop() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  647 |         Placement_type placement = get_placement(profile);
      |                                    ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:467:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  467 |   loop();
      |   ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, 4, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:276:29:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Col_4 CGAL::Surface_mesh_simplification::internal::construct_optimal_point_singular(const typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4&, const typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4&, const typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4&) [with GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4 = Eigen::Matrix<double, 4, 1>; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4 = Eigen::Matrix<double, 4, 1>]'
  276 |         opt_pt = p0 + ext_t * (p1 - p0);
      |                       ~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_plane_policies.h:86:56:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:647:36:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::loop() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  647 |         Placement_type placement = get_placement(profile);
      |                                    ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:467:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  467 |   loop();
      |   ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 4, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 4, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 4, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 4, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> > >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 4, 1> >, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, 4, 1>, const Eigen::Matrix<double, 4, 1> > > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:276:21:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Col_4 CGAL::Surface_mesh_simplification::internal::construct_optimal_point_singular(const typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4&, const typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4&, const typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4&) [with GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4 = Eigen::Matrix<double, 4, 1>; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>; typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4 = Eigen::Matrix<double, 4, 1>]'
  276 |         opt_pt = p0 + ext_t * (p1 - p0);
      |                  ~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_plane_policies.h:86:56:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:647:36:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::loop() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  647 |         Placement_type placement = get_placement(profile);
      |                                    ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:467:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  467 |   loop();
      |   ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Inverse<Eigen::Matrix<double, 4, 4, 2, 4, 4> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Inverse<Eigen::Matrix<double, 4, 4, 2, 4, 4> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Inverse<Eigen::Matrix<double, 4, 4, 2, 4, 4> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Inverse.h:68:7:   required from 'class Eigen::InverseImpl<Eigen::Matrix<double, 4, 4, 2, 4, 4>, Eigen::Dense>'
   68 | class InverseImpl
      |       ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Inverse.h:43:7:   required from 'class Eigen::Inverse<Eigen::Matrix<double, 4, 4, 2, 4, 4> >'
   43 | class Inverse : public InverseImpl<XprType,typename internal::traits<XprType>::StorageKind>
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:216:21:   required from 'typename CGAL::Surface_mesh_simplification::internal::GarlandHeckbert_matrix_types<GeomTraits>::Col_4 CGAL::Surface_mesh_simplification::internal::construct_optimal_point_invertible(const typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4&) [with GeomTraits = CGAL::Epick; typename GarlandHeckbert_matrix_types<GeomTraits>::Col_4 = Eigen::Matrix<double, 4, 1>; typename GarlandHeckbert_matrix_types<GeomTraits>::Mat_4 = Eigen::Matrix<double, 4, 4, 2, 4, 4>]'
  216 |   opt_pt = x.inverse().col(3); // == X.inverse() * (0 0 0 1)
      |            ~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_probabilistic_plane_policies.h:129:58:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:647:36:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::loop() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  647 |         Placement_type placement = get_placement(profile);
      |                                    ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:467:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  467 |   loop();
      |   ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Inverse<Eigen::Matrix<double, 4, 4, 2, 4, 4> >, 4, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Inverse<Eigen::Matrix<double, 4, 4, 2, 4, 4> >, 4, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Inverse<Eigen::Matrix<double, 4, 4, 2, 4, 4> >, 4, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:172:103:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Inverse<Eigen::Matrix<double, 4, 4, 2, 4, 4> >, 4, 1, true, false>'
  172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
      |                                                                                                       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::Inverse<Eigen::Matrix<double, 4, 4, 2, 4, 4> >, 4, 1, true, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   required from 'class Eigen::Block<const Eigen::Inverse<Eigen::Matrix<double, 4, 4, 2, 4, 4> >, 4, 1, true>'
  103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:216:27:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:647:36:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::loop() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  647 |         Placement_type placement = get_placement(profile);
      |                                    ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:467:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  467 |   loop();
      |   ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:251:39:   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::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0>; Rhs = Eigen::Matrix<double, 4, 1>]'
  251 |     dst.coeffRef(0,0) = (lhs.transpose().cwiseProduct(rhs)).sum();
      |                          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:513:21:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::collect() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  513 |       data.cost() = cost(profile);
      |                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:464:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  464 |   collect();
      |   ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0> >, const Eigen::Matrix<double, 4, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0> >, const Eigen::Matrix<double, 4, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0> >, const Eigen::Matrix<double, 4, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0> >, const Eigen::Matrix<double, 4, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0> >, const Eigen::Matrix<double, 4, 1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 0>; Rhs = Eigen::Matrix<double, 4, 1>]'
  251 |     dst.coeffRef(0,0) = (lhs.transpose().cwiseProduct(rhs)).sum();
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:513:21:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::collect() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  513 |       data.cost() = cost(profile);
      |                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:464:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  464 |   collect();
      |   ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:277:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4, 2, 4, 4>, -1, -1, false>; SrcXprType = Eigen::Matrix<double, 3, 3>; Functor = add_assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4, 2, 4, 4>, -1, -1, false>; SrcXprType = Eigen::Matrix<double, 3, 3>; Functor = Eigen::internal::add_assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4, 2, 4, 4>, -1, -1, false>; Src = Eigen::Matrix<double, 3, 3>; Func = add_assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:851: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, 4, 4, 2, 4, 4>, -1, -1, false>; Src = Eigen::Product<Eigen::Matrix<double, 3, 1>, Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 0>; Func = add_assign_op<double, double>; typename enable_if<evaluator_assume_aliasing<Src>::value, void*>::type = void*; typename evaluator_traits<SrcXprType>::Shape = Eigen::DenseShape]'
  851 |   call_assignment_no_alias(dst, tmp, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:177:18:   required from 'Derived& Eigen::MatrixBase<Derived>::operator+=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Matrix<double, 3, 1>, Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 0>; Derived = Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false>]'
  177 |   call_assignment(derived(), other.derived(), internal::add_assign_op<Scalar,typename OtherDerived::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_functions.h:432:25:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<Eigen::Matrix<double, 1, 4> >, Eigen::Matrix<double, 1, 4>, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<Eigen::Matrix<double, 1, 4> >, Eigen::Matrix<double, 1, 4>, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<Eigen::Matrix<double, 1, 4> >, Eigen::Matrix<double, 1, 4>, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<Eigen::Matrix<double, 1, 4> >, Eigen::Matrix<double, 1, 4>, 1, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<Eigen::Matrix<double, 1, 4> >, Eigen::Matrix<double, 1, 4>, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Transpose<Eigen::Matrix<double, 1, 4> >, Eigen::Matrix<double, 1, 4>, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:162:40:   required from here
  162 |     r = collapse_gh<Classic_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1043:41:   required from 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, -1, 1, false> >'
 1043 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, -1, 1, false>; SrcXprType = Eigen::CwiseUnaryOp<scalar_opposite_op<double>, const Eigen::Matrix<double, 3, 1> >; Functor = assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, -1, 1, false>; SrcXprType = Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Matrix<double, 3, 1> >; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, -1, 1, false>; Src = Eigen::CwiseUnaryOp<scalar_opposite_op<double>, const Eigen::Matrix<double, 3, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, -1, 1, false>; Src = Eigen::CwiseUnaryOp<scalar_opposite_op<double>, const Eigen::Matrix<double, 3, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, -1, 1, false>; SrcXprType = Eigen::CwiseUnaryOp<scalar_opposite_op<double>, const Eigen::Matrix<double, 3, 1> >; Functor = assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, -1, 1, false>; SrcXprType = Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Matrix<double, 3, 1> >; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, -1, 1, false>; Src = Eigen::CwiseUnaryOp<scalar_opposite_op<double>, const Eigen::Matrix<double, 3, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, -1, 1, false>; Src = Eigen::CwiseUnaryOp<scalar_opposite_op<double>, const Eigen::Matrix<double, 3, 1> >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, -1, 1, false>; Src = Eigen::CwiseUnaryOp<scalar_opposite_op<double>, const Eigen::Matrix<double, 3, 1> >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Assign.h:66:28:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1043:41:   required from 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 1, -1, false> >'
 1043 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 1, -1, false>; SrcXprType = Eigen::CwiseUnaryOp<scalar_opposite_op<double>, const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> > >; Functor = assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 1, -1, false>; SrcXprType = Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> > >; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 1, -1, false>; Src = Eigen::CwiseUnaryOp<scalar_opposite_op<double>, const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> > >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 1, -1, false>; Src = Eigen::CwiseUnaryOp<scalar_opposite_op<double>, const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> > >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 1, -1, false>; SrcXprType = Eigen::CwiseUnaryOp<scalar_opposite_op<double>, const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> > >; Functor = assign_op<double, double>]'
  780 |   DstEvaluatorType dstEvaluator(dst);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 1, -1, false>; SrcXprType = Eigen::CwiseUnaryOp<Eigen::internal::scalar_opposite_op<double>, const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> > >; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 1, -1, false>; Src = Eigen::CwiseUnaryOp<scalar_opposite_op<double>, const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> > >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 1, -1, false>; Src = Eigen::CwiseUnaryOp<scalar_opposite_op<double>, const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> > >; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block<Eigen::Block<Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1, 4, false>, 1, -1, false>; Src = Eigen::CwiseUnaryOp<scalar_opposite_op<double>, const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> > >]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Assign.h:66:28:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Matrix<double, 3, 1>, Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Matrix<double, 3, 1>, Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Matrix<double, 3, 1>, Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Matrix<double, 3, 1>, Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1, 4>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Matrix<double, 3, 1>, Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Matrix<double, 3, 1>, Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Inverse<Eigen::Matrix<double, 4, 4, 2, 4, 4> >, 4, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 1>; SrcXprType = Eigen::Block<const Eigen::Inverse<Eigen::Matrix<double, 4, 4, 2, 4, 4> >, 4, 1, true>; Functor = assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 1>; SrcXprType = Eigen::Block<const Eigen::Inverse<Eigen::Matrix<double, 4, 4, 2, 4, 4> >, 4, 1, true>; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 1>; Src = Eigen::Block<const Eigen::Inverse<Eigen::Matrix<double, 4, 4, 2, 4, 4> >, 4, 1, true>; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 4, 1>; Src = Eigen::Block<const Eigen::Inverse<Eigen::Matrix<double, 4, 4, 2, 4, 4> >, 4, 1, true>; 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix<double, 4, 1>; Src = Eigen::Block<const Eigen::Inverse<Eigen::Matrix<double, 4, 4, 2, 4, 4> >, 4, 1, true>]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:647:36:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::loop() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  647 |         Placement_type placement = get_placement(profile);
      |                                    ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:467:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  467 |   loop();
      |   ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:164:39:   required from here
  164 |     r = collapse_gh<Prob_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4, 2, 4, 4>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false>; Functor = assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4, 2, 4, 4>, -1, -1, false>; SrcXprType = Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false>; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4, 2, 4, 4>, -1, -1, false>; Src = Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false>; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4, 2, 4, 4>, -1, -1, false>; Src = Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, -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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, 4, 4, 2, 4, 4>, -1, -1, false>; Src = Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, -1, -1, false>]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Assign.h:66:28:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:647:36:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::loop() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  647 |         Placement_type placement = get_placement(profile);
      |                                    ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:467:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  467 |   loop();
      |   ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 3, 1>, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:37:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 1>; Rhs = Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >; int ProductTag = 4; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Matrix<double, 3, 1>; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, Eigen::Matrix<double, 4, 4, 2, 4, 4>, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:513:21:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::collect() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  513 |       data.cost() = cost(profile);
      |                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:464:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  464 |   collect();
      |   ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 1>, 1, 1, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 1> >, 1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 1, 3>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 1, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Matrix<double, 3, 3, 2, 3, 3>, Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 1>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:402:50:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 29 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:513:21:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::collect() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  513 |       data.cost() = cost(profile);
      |                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:464:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  464 |   collect();
      |   ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618:37:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:513:21:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::collect() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  513 |       data.cost() = cost(profile);
      |                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:464:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  464 |   collect();
      |   ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 29 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:513:21:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::collect() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  513 |       data.cost() = cost(profile);
      |                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:464:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  464 |   collect();
      |   ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> >, const Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> >, const Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> >, const Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> >, const Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> >, const Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:618: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) const [with Lhs = Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >; Rhs = Eigen::Matrix<double, 4, 4, 2, 4, 4>; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Matrix<double, 4, 4, 2, 4, 4>; CoeffReturnType = double; Eigen::Index = long long int]'
  618 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:513:21:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::collect() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  513 |       data.cost() = cost(profile);
      |                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:464:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  464 |   collect();
      |   ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 30 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:37:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 3, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 3, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 3, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 3, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 3, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 3, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 30 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 3, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 3, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 3, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 3, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 3, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3, 2, 3, 3>; Rhs = Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >; int ProductTag = 3; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Matrix<double, 3, 3, 2, 3, 3>; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >; CoeffReturnType = double; Eigen::Index = long long int]'
  606 |     return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63:   [ skipping 27 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> >, const Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 31 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:513:21:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::collect() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  513 |       data.cost() = cost(profile);
      |                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:464:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  464 |   collect();
      |   ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> >, const Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> >, const Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> >, const Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 4, 1> >, 1, 4, true> >, const Eigen::Block<const Eigen::Matrix<double, 4, 4, 2, 4, 4>, 4, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 28 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:513:21:   required from 'void CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::collect() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  513 |       data.cost() = cost(profile);
      |                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:464:3:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  464 |   collect();
      |   ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_plane_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:160:42:   required from here
  160 |     r = collapse_gh<Classic_plane, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 3, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 32 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 3, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 3, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 3, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 3, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 3, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Matrix<double, 3, 3, 2, 3, 3>, 1, 3, false> >, const Eigen::Block<const Eigen::Transpose<const Eigen::Matrix<double, 3, 3, 2, 3, 3> >, 3, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 29 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:56:52:   required from 'void CGAL::Surface_mesh_simplification::internal::Oracles_initializer<EdgeCollapse, true>::operator()() const [with EdgeCollapse = CGAL::Surface_mesh_simplification::EdgeCollapse<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick, CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>, CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>, CGAL::Surface_mesh_simplification::internal::Dummy_visitor, false>]'
   56 |   void operator()() const { e.get_cost().initialize(e.mesh(), e.vpm(), e.geom_traits()); }
      |                             ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h:461:45:   required from 'int CGAL::Surface_mesh_simplification::EdgeCollapse<TM_, GeomTraits_, ShouldStop_, VertexIndexMap_, VertexPointMap_, HalfedgeIndexMap_, EdgeIsConstrainedMap_, GetCost_, GetPlacement_, ShouldIgnore_, VisitorT_, use_relaxed_heap>::run() [with TM_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GeomTraits_ = CGAL::Epick; ShouldStop_ = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap_ = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap_ = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap_ = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement_ = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore_ = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; VisitorT_ = CGAL::Surface_mesh_simplification::internal::Dummy_visitor; bool use_relaxed_heap = false]'
  461 |   internal::Oracles_initializer<Self>(*this)();
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:60:23:   required from 'int CGAL::Surface_mesh_simplification::internal::edge_collapse(TM&, const ShouldStop&, const GT&, const VertexIndexMap&, const VertexPointMap&, const HalfedgeIndexMap&, const EdgeIsConstrainedMap&, const GetCost&, const GetPlacement&, const ShouldIgnore&, Visitor) [with bool use_relaxed_order = false; TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; GT = CGAL::Epick; ShouldStop = CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; VertexIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Vertex_index>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; HalfedgeIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Halfedge_index>; EdgeIsConstrainedMap = CGAL::Surface_mesh_simplification::No_constrained_edge_map<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; GetCost = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; GetPlacement = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; ShouldIgnore = CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<>; Visitor = Dummy_visitor]'
   60 |   return algorithm.run();
      |          ~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:98:33:   required from 'int CGAL::Surface_mesh_simplification::edge_collapse(TM&, const ShouldStop&, const NamedParameters&) [with TM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; ShouldStop = Edge_count_ratio_stop_predicate<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_placement_policy_t, CGAL::Named_function_parameters<Bounded_normal_change_filter<>, CGAL::internal_np::filter_t, CGAL::Named_function_parameters<GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>, CGAL::internal_np::get_cost_policy_t, CGAL::internal_np::No_property> > >]'
   97 |   return internal::edge_collapse<Use_relaxed_order::value>
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   98 |                                 (tmesh, should_stop,
      |                                 ^~~~~~~~~~~~~~~~~~~~
   99 |                                  choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  100 |                                  CGAL::get_initialized_vertex_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  101 |                                  choose_parameter(get_parameter(np, internal_np::vertex_point),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |                                                   get_property_map(vertex_point, tmesh)),
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |                                  CGAL::get_initialized_halfedge_index_map(tmesh, np),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  104 |                                  choose_parameter<No_constrained_edge_map<TM> >(get_parameter(np, internal_np::edge_is_constrained)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  105 |                                  choose_parameter<LindstromTurk_cost<TM> >(get_parameter(np, internal_np::get_cost_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  106 |                                  choose_parameter<LindstromTurk_placement<TM> >(get_parameter(np, internal_np::get_placement_policy)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  107 |                                  choose_parameter<internal::Dummy_filter>(get_parameter(np, internal_np::filter)),
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  108 |                                  choose_parameter<internal::Dummy_visitor>(get_parameter(np, internal_np::visitor)));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:119:29:   required from 'int collapse_gh(MeshT&, double) [with GHPolicies = CGAL::Surface_mesh_simplification::GarlandHeckbert_probabilistic_triangle_policies<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >]'
  119 |   int r = SMS::edge_collapse(mesh, stop,
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
  120 |                              CGAL::parameters::get_cost(gh_cost)
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                                  .filter(filter)
      |                                  ~~~~~~~~~~~~~~~
  122 |                                  .get_placement(gh_placement));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_simplify.cpp:166:37:   required from here
  166 |     r = collapse_gh<Prob_tri, Mesh3>(mesh, ueRatio);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
g++  -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.7/BH/include' -I'D:/RCompile/CRANpkg/lib/4.7/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"   -DCGAL_HEADER_ONLY=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c export_remesh_smooth.cpp -o export_remesh_smooth.o
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:205,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dimension.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Bbox_2.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic_classes.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
                 from SurfaceMesh.h:17,
                 from export_remesh_smooth.cpp:14:
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                       ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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) {
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:174:
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/bind.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian_converter.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Filtered_kernel.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:21:
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/property_map.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
                 from SurfaceMesh.h:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/std_thread.h:43,
                 from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/thread:45,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/config.h:428,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20:
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:165:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<float, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<float> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46:   required from here
   24 |     ResAlignment = traits<Quaternion<float> >::Alignment
      |                                              ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:271:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<float, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<float, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<float> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<float>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3:   required from here
   27 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<double> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47:   required from here
   98 |     ResAlignment = traits<Quaternion<double> >::Alignment
      |                                               ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<double> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<double>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3:   required from here
  102 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/SparseCore:37,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Sparse:26,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:21,
                 from export_remesh_smooth.cpp:17:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::SparseMatrix<double, 0, int> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7:   required from 'class Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 0, int> >'
   36 | class SparseCompressedBase
      |       ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7:   required from 'class Eigen::SparseMatrix<double, 0, int>'
   96 | class SparseMatrix
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:293:21:   required from 'struct CGAL::Eigen_sparse_matrix<double>'
  293 |   mutable EigenType m_matrix;
      |                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:99:74:   required from here
   99 | template<class EigenSolverT = Eigen::BiCGSTAB<Eigen_sparse_matrix<double>::EigenType> >
      |                                                                          ^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7:   required from 'class Eigen::SparseCompressedBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >'
   36 | class SparseCompressedBase
      |       ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMap.h:50:7:   required from 'class Eigen::SparseMapBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 0>'
   50 | class SparseMapBase<Derived,ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:83:34:   required from 'class Eigen::internal::SparseRefBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >'
   83 | template<typename Derived> class SparseRefBase
      |                                  ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:177:7:   required from 'class Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >'
  177 | class Ref<const SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:37:41:   required from 'struct Eigen::internal::is_ref_compatible_impl<Eigen::SparseMatrix<double, 0, int> >'
   37 |   enum { value = sizeof(test<MatrixType>(ms_from, 0))==sizeof(yes) };
      |                        ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:43:81:   required from 'struct Eigen::internal::is_ref_compatible<Eigen::SparseMatrix<double, 0, int> >'
   43 |   enum { value = is_ref_compatible_impl<typename remove_all<MatrixType>::type>::value };
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:46:49:   required from 'class Eigen::IterativeSolverBase<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> > >'
   46 | template<typename MatrixType, bool MatrixFree = !internal::is_ref_compatible<MatrixType>::value>
      |                                                 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:158:7:   required from 'class Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >'
  158 | class BiCGSTAB : public IterativeSolverBase<BiCGSTAB<_MatrixType,_Preconditioner> >
      |       ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:239:23:   required from here
  239 |   typedef EigenSolverT::Scalar                                          Scalar;
      |                       ^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, -1>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, -1, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h:41:43:   required from 'class Eigen::DiagonalPreconditioner<double>'
   41 |     typedef typename Vector::StorageIndex StorageIndex;
      |                                           ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:431:18:   required from 'class Eigen::IterativeSolverBase<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> > >'
  431 |   Preconditioner m_preconditioner;
      |                  ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:158:7:   required from 'class Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >'
  158 | class BiCGSTAB : public IterativeSolverBase<BiCGSTAB<_MatrixType,_Preconditioner> >
      |       ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:239:23:   required from here
  239 |   typedef EigenSolverT::Scalar                                          Scalar;
      |                       ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, -1, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h:41:43:   required from 'class Eigen::DiagonalPreconditioner<double>'
   41 |     typedef typename Vector::StorageIndex StorageIndex;
      |                                           ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:431:18:   required from 'class Eigen::IterativeSolverBase<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> > >'
  431 |   Preconditioner m_preconditioner;
      |                  ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:158:7:   required from 'class Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >'
  158 | class BiCGSTAB : public IterativeSolverBase<BiCGSTAB<_MatrixType,_Preconditioner> >
      |       ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:239:23:   required from here
  239 |   typedef EigenSolverT::Scalar                                          Scalar;
      |                       ^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:41:7:   required from 'class Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >'
   41 | class SolveWithGuess : public internal::generic_xpr_base<SolveWithGuess<Decomposition,RhsType,GuessType>, MatrixXpr, typename internal::traits<RhsType>::StorageKind>::type
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:38:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::SparseMatrix<double, 1, int> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7:   required from 'class Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 1, int> >'
   36 | class SparseCompressedBase
      |       ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7:   required from 'class Eigen::SparseMatrix<double, 1, int>'
   96 | class SparseMatrix
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h:191:16:   required from 'class Eigen::IncompleteLUT<double>'
  191 |     FactorType m_lu;
      |                ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:431:18:   required from 'class Eigen::IterativeSolverBase<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >'
  431 |   Preconditioner m_preconditioner;
      |                  ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:158:7:   required from 'struct Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >'
  158 | class BiCGSTAB : public IterativeSolverBase<BiCGSTAB<_MatrixType,_Preconditioner> >
      |       ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:102:71:   required from 'class CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >'
  102 |   typedef typename EigenSolverT::Scalar                               Scalar;
      |                                                                       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:168:83:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  168 |   typedef typename Sparse_solver::Matrix                                          Eigen_matrix;
      |                                                                                   ^~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Matrix<double, -1, 1>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:717:21:   required from 'Derived& Eigen::PlainObjectBase<Derived>::setOnes(Eigen::Index) [with Derived = Eigen::Matrix<double, -1, 1>; Eigen::Index = long long int]'
  717 |   return setConstant(Scalar(1));
      |          ~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:276:14:   required from here
  276 |     X.setOnes(B.rows());
      |     ~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:179:23:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::linear_solver(const Vector&, Vector&) [with EigenSolverT = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >; Vector = CGAL::Eigen_vector<double>]'
  179 |     X = solver().solve(B);
      |         ~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h:142:29:   required from 'bool CGAL::Polygon_mesh_processing::internal::Shape_smoother<TriangleMesh, VertexPointMap, VertexConstraintMap, SparseLinearSolver, GeomTraits>::solve_system(const Eigen_matrix&, Eigen_vector&, Eigen_vector&, Eigen_vector&, const Eigen_vector&, const Eigen_vector&, const Eigen_vector&, SparseLinearSolver&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; VertexConstraintMap = CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >; GeomTraits = CGAL::Epick; Eigen_matrix = CGAL::Eigen_sparse_matrix<double>; Eigen_vector = CGAL::Eigen_vector<double>]'
  142 |     if(!solver.linear_solver(bx, Xx) ||
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:194:29:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  194 |     if(smoother.solve_system(A, Xx, Xy, Xz, bx, by, bz, solver))
      |        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::SparseMatrix<double, 1, int>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80:   required from 'struct Eigen::internal::evaluator<Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 1, int> > >'
  336 |   typedef typename DenseCoeffsBase<Derived,ReadOnlyAccessors>::CoeffReturnType CoeffReturnType;
      |                                                                                ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8:   required from 'struct Eigen::internal::evaluator<Eigen::SparseMatrix<double, 1, int> >'
 1505 | struct evaluator<SparseMatrix<_Scalar,_Options,_StorageIndex> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1181:93:   required from 'Eigen::SparseMatrix<_Scalar, _Options, _StorageIndex>& Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::operator=(const Eigen::SparseMatrixBase<OtherDerived>&) [with OtherDerived = Eigen::SparseMatrix<double, 1, int>; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1181 |   const bool needToTranspose = (Flags & RowMajorBit) != (internal::evaluator<OtherDerived>::Flags & RowMajorBit);
      |                                                                                             ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1063:7:   required from 'void Eigen::internal::set_from_triplets(const InputIterator&, const InputIterator&, SparseMatrixType&, DupFunctor) [with InputIterator = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; SparseMatrixType = Eigen::SparseMatrix<double, 0, int>; DupFunctor = scalar_sum_op<double, double>]'
 1063 |   mat = trMat;
      |   ~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1110:92:   required from 'void Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::setFromTriplets(const InputIterators&, const InputIterators&) [with InputIterators = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1110 |   internal::set_from_triplets<InputIterators, SparseMatrix<Scalar,_Options,_StorageIndex> >(begin, end, *this, internal::scalar_sum_op<Scalar,Scalar>());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:239:29:   required from 'void CGAL::Eigen_sparse_matrix<T>::assemble_matrix() const [with T = double]'
  239 |     m_matrix.setFromTriplets(m_triplets.begin(), m_triplets.end());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:249:7:   required from 'const CGAL::Eigen_sparse_matrix<T>::EigenType& CGAL::Eigen_sparse_matrix<T>::eigen_object() const [with T = double; EigenType = Eigen::SparseMatrix<double, 0, int>]'
  249 |       assemble_matrix();
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:271:42:   required from here
  271 |     m_solver_sptr->compute(A.eigen_object());
      |                            ~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::Transpose<const Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > > >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7:   required from 'class Eigen::SparseCompressedBase<Eigen::Transpose<const Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > > >'
   36 | class SparseCompressedBase
      |       ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:22:9:   required from 'class Eigen::internal::SparseTransposeImpl<const Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 1024>'
   22 |   class SparseTransposeImpl<MatrixType,CompressedAccessBit>
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:45:37:   required from 'class Eigen::TransposeImpl<const Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Sparse>'
   45 | template<typename MatrixType> class TransposeImpl<MatrixType,Sparse>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h:230:68:   required from 'void Eigen::IncompleteLUT<_Scalar, _StorageIndex>::analyzePattern(const _MatrixType&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; _Scalar = double; _StorageIndex = int]'
  230 |   SparseMatrix<Scalar,ColMajor, StorageIndex> mat2 = amat.transpose();
      |                                                      ~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h:162:21:   required from 'Eigen::IncompleteLUT<_Scalar, _StorageIndex>& Eigen::IncompleteLUT<_Scalar, _StorageIndex>::compute(const MatrixType&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; _Scalar = double; _StorageIndex = int]'
  162 |       analyzePattern(amat);
      |       ~~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:241:29:   required from 'Derived& Eigen::IterativeSolverBase<Derived>::compute(const Eigen::EigenBase<OtherDerived>&) [with MatrixDerived = Eigen::SparseMatrix<double, 0, int>; Derived = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >]'
  241 |     m_preconditioner.compute(matrix());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:169:21:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::factor(const Matrix&, NT&) [with EigenSolverT = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >; Matrix = CGAL::Eigen_sparse_matrix<double>; NT = double]'
  169 |     solver().compute(*m_mat);
      |     ~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h:134:22:   required from 'bool CGAL::Polygon_mesh_processing::internal::Shape_smoother<TriangleMesh, VertexPointMap, VertexConstraintMap, SparseLinearSolver, GeomTraits>::solve_system(const Eigen_matrix&, Eigen_vector&, Eigen_vector&, Eigen_vector&, const Eigen_vector&, const Eigen_vector&, const Eigen_vector&, SparseLinearSolver&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; VertexConstraintMap = CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >; GeomTraits = CGAL::Epick; Eigen_matrix = CGAL::Eigen_sparse_matrix<double>; Eigen_vector = CGAL::Eigen_vector<double>]'
  134 |     if(!solver.factor(A, D))
      |         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:194:29:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  194 |     if(smoother.solve_system(A, Xx, Xy, Xz, bx, by, bz, solver))
      |        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::SparseMatrix<double, 0, int>, const Eigen::SparseMatrix<double, 0, int> > >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCwiseBinaryOp.h:36:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::SparseMatrix<double, 0, int>, const Eigen::SparseMatrix<double, 0, int>, Eigen::Sparse>'
   36 | class CwiseBinaryOpImpl<BinaryOp, Lhs, Rhs, Sparse>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::SparseMatrix<double, 0, int>, const Eigen::SparseMatrix<double, 0, int> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h:233:58:   required from 'void Eigen::IncompleteLUT<_Scalar, _StorageIndex>::analyzePattern(const _MatrixType&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; _Scalar = double; _StorageIndex = int]'
  233 |   SparseMatrix<Scalar,ColMajor, StorageIndex> AtA = mat2 + mat1;
      |                                                     ~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h:162:21:   required from 'Eigen::IncompleteLUT<_Scalar, _StorageIndex>& Eigen::IncompleteLUT<_Scalar, _StorageIndex>::compute(const MatrixType&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; _Scalar = double; _StorageIndex = int]'
  162 |       analyzePattern(amat);
      |       ~~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:241:29:   required from 'Derived& Eigen::IterativeSolverBase<Derived>::compute(const Eigen::EigenBase<OtherDerived>&) [with MatrixDerived = Eigen::SparseMatrix<double, 0, int>; Derived = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >]'
  241 |     m_preconditioner.compute(matrix());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:169:21:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::factor(const Matrix&, NT&) [with EigenSolverT = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >; Matrix = CGAL::Eigen_sparse_matrix<double>; NT = double]'
  169 |     solver().compute(*m_mat);
      |     ~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h:134:22:   required from 'bool CGAL::Polygon_mesh_processing::internal::Shape_smoother<TriangleMesh, VertexPointMap, VertexConstraintMap, SparseLinearSolver, GeomTraits>::solve_system(const Eigen_matrix&, Eigen_vector&, Eigen_vector&, Eigen_vector&, const Eigen_vector&, const Eigen_vector&, const Eigen_vector&, SparseLinearSolver&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; VertexConstraintMap = CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >; GeomTraits = CGAL::Epick; Eigen_matrix = CGAL::Eigen_sparse_matrix<double>; Eigen_vector = CGAL::Eigen_vector<double>]'
  134 |     if(!solver.factor(A, D))
      |         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:194:29:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  194 |     if(smoother.solve_system(A, Xx, Xy, Xz, bx, by, bz, solver))
      |        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h:163:16:   required from 'Eigen::IncompleteLUT<_Scalar, _StorageIndex>& Eigen::IncompleteLUT<_Scalar, _StorageIndex>::compute(const MatrixType&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; _Scalar = double; _StorageIndex = int]'
  163 |       factorize(amat);
      |       ~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:241:29:   required from 'Derived& Eigen::IterativeSolverBase<Derived>::compute(const Eigen::EigenBase<OtherDerived>&) [with MatrixDerived = Eigen::SparseMatrix<double, 0, int>; Derived = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >]'
  241 |     m_preconditioner.compute(matrix());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:169:21:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::factor(const Matrix&, NT&) [with EigenSolverT = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >; Matrix = CGAL::Eigen_sparse_matrix<double>; NT = double]'
  169 |     solver().compute(*m_mat);
      |     ~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h:134:22:   required from 'bool CGAL::Polygon_mesh_processing::internal::Shape_smoother<TriangleMesh, VertexPointMap, VertexConstraintMap, SparseLinearSolver, GeomTraits>::solve_system(const Eigen_matrix&, Eigen_vector&, Eigen_vector&, Eigen_vector&, const Eigen_vector&, const Eigen_vector&, const Eigen_vector&, SparseLinearSolver&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; VertexConstraintMap = CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >; GeomTraits = CGAL::Epick; Eigen_matrix = CGAL::Eigen_sparse_matrix<double>; Eigen_vector = CGAL::Eigen_vector<double>]'
  134 |     if(!solver.factor(A, D))
      |         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:194:29:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  194 |     if(smoother.solve_system(A, Xx, Xy, Xz, bx, by, bz, solver))
      |        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80:   required from 'struct Eigen::internal::evaluator<Eigen::SparseCompressedBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > > >'
  336 |   typedef typename DenseCoeffsBase<Derived,ReadOnlyAccessors>::CoeffReturnType CoeffReturnType;
      |                                                                                ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:364:8:   required from 'struct Eigen::internal::evaluator<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >'
  364 | struct evaluator<Ref<const SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:687:97:   required from 'Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::SparseMatrix(const Eigen::SparseMatrixBase<OtherDerived>&) [with OtherDerived = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; _Scalar = double; int _Options = 0; _StorageIndex = int]'
  687 |       const bool needToTranspose = (Flags & RowMajorBit) != (internal::evaluator<OtherDerived>::Flags & RowMajorBit);
      |                                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h:229:47:   required from 'void Eigen::IncompleteLUT<_Scalar, _StorageIndex>::analyzePattern(const _MatrixType&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; _Scalar = double; _StorageIndex = int]'
  229 |   SparseMatrix<Scalar,ColMajor, StorageIndex> mat1 = amat;
      |                                               ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h:162:21:   required from 'Eigen::IncompleteLUT<_Scalar, _StorageIndex>& Eigen::IncompleteLUT<_Scalar, _StorageIndex>::compute(const MatrixType&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; _Scalar = double; _StorageIndex = int]'
  162 |       analyzePattern(amat);
      |       ~~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:241:29:   required from 'Derived& Eigen::IterativeSolverBase<Derived>::compute(const Eigen::EigenBase<OtherDerived>&) [with MatrixDerived = Eigen::SparseMatrix<double, 0, int>; Derived = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >]'
  241 |     m_preconditioner.compute(matrix());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:169:21:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::factor(const Matrix&, NT&) [with EigenSolverT = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >; Matrix = CGAL::Eigen_sparse_matrix<double>; NT = double]'
  169 |     solver().compute(*m_mat);
      |     ~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h:134:22:   required from 'bool CGAL::Polygon_mesh_processing::internal::Shape_smoother<TriangleMesh, VertexPointMap, VertexConstraintMap, SparseLinearSolver, GeomTraits>::solve_system(const Eigen_matrix&, Eigen_vector&, Eigen_vector&, Eigen_vector&, const Eigen_vector&, const Eigen_vector&, const Eigen_vector&, SparseLinearSolver&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; VertexConstraintMap = CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >; GeomTraits = CGAL::Epick; Eigen_matrix = CGAL::Eigen_sparse_matrix<double>; Eigen_vector = CGAL::Eigen_vector<double>]'
  134 |     if(!solver.factor(A, D))
      |         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:194:29:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  194 |     if(smoother.solve_system(A, Xx, Xy, Xz, bx, by, bz, solver))
      |        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::SparseMatrix<double, 0, int>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80:   required from 'struct Eigen::internal::evaluator<Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 0, int> > >'
  336 |   typedef typename DenseCoeffsBase<Derived,ReadOnlyAccessors>::CoeffReturnType CoeffReturnType;
      |                                                                                ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8:   required from 'struct Eigen::internal::evaluator<Eigen::SparseMatrix<double, 0, int> >'
 1505 | struct evaluator<SparseMatrix<_Scalar,_Options,_StorageIndex> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::SparseMatrix<double, 0, int> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCwiseBinaryOp.h:64:51:   required from 'struct Eigen::internal::binary_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::SparseMatrix<double, 0, int>, const Eigen::SparseMatrix<double, 0, int> >, Eigen::internal::IteratorBased, Eigen::internal::IteratorBased, double, double>'
   64 |   typedef typename evaluator<Lhs>::InnerIterator  LhsIterator;
      |                                                   ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   required from 'struct Eigen::internal::evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::SparseMatrix<double, 0, int>, const Eigen::SparseMatrix<double, 0, int> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:687:97:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h:162:21:   required from 'Eigen::IncompleteLUT<_Scalar, _StorageIndex>& Eigen::IncompleteLUT<_Scalar, _StorageIndex>::compute(const MatrixType&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; _Scalar = double; _StorageIndex = int]'
  162 |       analyzePattern(amat);
      |       ~~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:241:29:   required from 'Derived& Eigen::IterativeSolverBase<Derived>::compute(const Eigen::EigenBase<OtherDerived>&) [with MatrixDerived = Eigen::SparseMatrix<double, 0, int>; Derived = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >]'
  241 |     m_preconditioner.compute(matrix());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:169:21:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::factor(const Matrix&, NT&) [with EigenSolverT = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >; Matrix = CGAL::Eigen_sparse_matrix<double>; NT = double]'
  169 |     solver().compute(*m_mat);
      |     ~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h:134:22:   required from 'bool CGAL::Polygon_mesh_processing::internal::Shape_smoother<TriangleMesh, VertexPointMap, VertexConstraintMap, SparseLinearSolver, GeomTraits>::solve_system(const Eigen_matrix&, Eigen_vector&, Eigen_vector&, Eigen_vector&, const Eigen_vector&, const Eigen_vector&, const Eigen_vector&, SparseLinearSolver&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; VertexConstraintMap = CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >; GeomTraits = CGAL::Epick; Eigen_matrix = CGAL::Eigen_sparse_matrix<double>; Eigen_vector = CGAL::Eigen_vector<double>]'
  134 |     if(!solver.factor(A, D))
      |         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:194:29:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  194 |     if(smoother.solve_system(A, Xx, Xy, Xz, bx, by, bz, solver))
      |        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:42:29:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:42:23:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   42 |   VectorType r  = rhs - mat * x;
      |                   ~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:27:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
      |                         ~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:23:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
      |                    ~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:18:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
      |             ~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:11:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
      |         ~~^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:85:22:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   85 |     y = precond.solve(p);
      |         ~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:100:20:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
  100 |     x += alpha * y + w * z;
      |          ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::Transpose<const Eigen::SparseMatrix<double, 0, int> > >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7:   required from 'class Eigen::SparseCompressedBase<Eigen::Transpose<const Eigen::SparseMatrix<double, 0, int> > >'
   36 | class SparseCompressedBase
      |       ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:22:9:   required from 'class Eigen::internal::SparseTransposeImpl<const Eigen::SparseMatrix<double, 0, int>, 1024>'
   22 |   class SparseTransposeImpl<MatrixType,CompressedAccessBit>
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:45:37:   required from 'class Eigen::TransposeImpl<const Eigen::SparseMatrix<double, 0, int>, Eigen::Sparse>'
   45 | template<typename MatrixType> class TransposeImpl<MatrixType,Sparse>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::SparseMatrix<double, 0, int> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/OrderingMethods/Ordering.h:30:18:   required from 'void Eigen::internal::ordering_helper_at_plus_a(const MatrixType&, MatrixType&) [with MatrixType = Eigen::SparseMatrix<double, 0, int>]'
   30 |   C = A.transpose(); // NOTE: Could be  costly
      |       ~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/OrderingMethods/Ordering.h:63:42:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h:162:21:   required from 'Eigen::IncompleteLUT<_Scalar, _StorageIndex>& Eigen::IncompleteLUT<_Scalar, _StorageIndex>::compute(const MatrixType&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; _Scalar = double; _StorageIndex = int]'
  162 |       analyzePattern(amat);
      |       ~~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:241:29:   required from 'Derived& Eigen::IterativeSolverBase<Derived>::compute(const Eigen::EigenBase<OtherDerived>&) [with MatrixDerived = Eigen::SparseMatrix<double, 0, int>; Derived = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >]'
  241 |     m_preconditioner.compute(matrix());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:169:21:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::factor(const Matrix&, NT&) [with EigenSolverT = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >; Matrix = CGAL::Eigen_sparse_matrix<double>; NT = double]'
  169 |     solver().compute(*m_mat);
      |     ~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h:134:22:   required from 'bool CGAL::Polygon_mesh_processing::internal::Shape_smoother<TriangleMesh, VertexPointMap, VertexConstraintMap, SparseLinearSolver, GeomTraits>::solve_system(const Eigen_matrix&, Eigen_vector&, Eigen_vector&, Eigen_vector&, const Eigen_vector&, const Eigen_vector&, const Eigen_vector&, SparseLinearSolver&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; VertexConstraintMap = CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >; GeomTraits = CGAL::Epick; Eigen_matrix = CGAL::Eigen_sparse_matrix<double>; Eigen_vector = CGAL::Eigen_vector<double>]'
  134 |     if(!solver.factor(A, D))
      |         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:194:29:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  194 |     if(smoother.solve_system(A, Xx, Xy, Xz, bx, by, bz, solver))
      |        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Matrix<double, -1, 1>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:45:40:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:277:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:391:7:   required from 'Eigen::DenseCoeffsBase<Derived, 1>::Scalar& Eigen::DenseCoeffsBase<Derived, 1>::coeffRef(Eigen::Index) [with Derived = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Scalar = double; Eigen::Index = long long int]'
  391 |       EIGEN_STATIC_ASSERT(internal::evaluator<Derived>::Flags & LinearAccessBit,
      |                                                         ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:428:22:   required from 'Eigen::DenseCoeffsBase<Derived, 1>::Scalar& Eigen::DenseCoeffsBase<Derived, 1>::operator()(Eigen::Index) [with Derived = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Scalar = double; Eigen::Index = long long int]'
  428 |       return coeffRef(index);
      |              ~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h:45:32:   required from 'Eigen::Index Eigen::internal::QuickSplit(VectorV&, VectorI&, Eigen::Index) [with VectorV = Eigen::VectorBlock<Eigen::Matrix<double, -1, 1>, -1>; VectorI = Eigen::VectorBlock<Eigen::Matrix<int, -1, 1>, -1>; Eigen::Index = long long int]'
   45 |     RealScalar abskey = abs(row(mid));
      |                             ~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h:409:25:   required from 'void Eigen::IncompleteLUT<_Scalar, _StorageIndex>::factorize(const _MatrixType&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; _Scalar = double; _StorageIndex = int]'
  409 |     internal::QuickSplit(ul, jul, len);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h:163:16:   required from 'Eigen::IncompleteLUT<_Scalar, _StorageIndex>& Eigen::IncompleteLUT<_Scalar, _StorageIndex>::compute(const MatrixType&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; _Scalar = double; _StorageIndex = int]'
  163 |       factorize(amat);
      |       ~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:241:29:   required from 'Derived& Eigen::IterativeSolverBase<Derived>::compute(const Eigen::EigenBase<OtherDerived>&) [with MatrixDerived = Eigen::SparseMatrix<double, 0, int>; Derived = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >]'
  241 |     m_preconditioner.compute(matrix());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:169:21:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::factor(const Matrix&, NT&) [with EigenSolverT = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >; Matrix = CGAL::Eigen_sparse_matrix<double>; NT = double]'
  169 |     solver().compute(*m_mat);
      |     ~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h:134:22:   required from 'bool CGAL::Polygon_mesh_processing::internal::Shape_smoother<TriangleMesh, VertexPointMap, VertexConstraintMap, SparseLinearSolver, GeomTraits>::solve_system(const Eigen_matrix&, Eigen_vector&, Eigen_vector&, Eigen_vector&, const Eigen_vector&, const Eigen_vector&, const Eigen_vector&, SparseLinearSolver&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; VertexConstraintMap = CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >; GeomTraits = CGAL::Epick; Eigen_matrix = CGAL::Eigen_sparse_matrix<double>; Eigen_vector = CGAL::Eigen_vector<double>]'
  134 |     if(!solver.factor(A, D))
      |         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:194:29:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  194 |     if(smoother.solve_system(A, Xx, Xy, Xz, bx, by, bz, solver))
      |        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:44:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Matrix<double, -1, 1>; U = Eigen::Matrix<double, -1, 1>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::IncompleteLUT<double>, Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::IncompleteLUT<double>, Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::IncompleteLUT<double>, Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::IncompleteLUT<double>, Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::IncompleteLUT<double>, Eigen::Matrix<double, -1, 1> >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:85:22:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::IncompleteLUT<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   85 |     y = precond.solve(p);
      |         ~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:179:7:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::linear_solver(const Vector&, Vector&) [with EigenSolverT = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >; Vector = CGAL::Eigen_vector<double>]'
  179 |     X = solver().solve(B);
      |     ~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h:142:29:   required from 'bool CGAL::Polygon_mesh_processing::internal::Shape_smoother<TriangleMesh, VertexPointMap, VertexConstraintMap, SparseLinearSolver, GeomTraits>::solve_system(const Eigen_matrix&, Eigen_vector&, Eigen_vector&, Eigen_vector&, const Eigen_vector&, const Eigen_vector&, const Eigen_vector&, SparseLinearSolver&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; VertexConstraintMap = CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >; GeomTraits = CGAL::Epick; Eigen_matrix = CGAL::Eigen_sparse_matrix<double>; Eigen_vector = CGAL::Eigen_vector<double>]'
  142 |     if(!solver.linear_solver(bx, Xx) ||
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:194:29:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  194 |     if(smoother.solve_system(A, Xx, Xy, Xz, bx, by, bz, solver))
      |        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:46:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Matrix<double, -1, 1>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:45:40:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   45 |   RealScalar r0_sqnorm = r0.squaredNorm();
      |                          ~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:51:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Matrix<double, -1, 1>; U = Eigen::Matrix<double, -1, 1>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   required from 'typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType Eigen::MatrixBase<Derived>::dot(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Matrix<double, -1, 1>; Derived = Eigen::Matrix<double, -1, 1>; typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType = double; typename Eigen::internal::traits<T>::Scalar = double; typename Eigen::internal::traits<OtherDerived>::Scalar = double]'
   84 |   return internal::dot_nocheck<Derived,OtherDerived>::run(*this, other);
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:71:17:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h:91:26:   required from 'void Eigen::DiagonalPreconditioner<_Scalar>::_solve_impl(const Rhs&, Dest&) const [with Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; _Scalar = double]'
   91 |       x = m_invdiag.array() * b.array() ;
      |           ~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:147:26:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h:91:29:   required from 'void Eigen::DiagonalPreconditioner<_Scalar>::_solve_impl(const Rhs&, Dest&) const [with Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; _Scalar = double]'
   91 |       x = m_invdiag.array() * b.array() ;
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:147:26:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h:173:18:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:179:7:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::linear_solver(const Vector&, Vector&) [with EigenSolverT = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >; Vector = CGAL::Eigen_vector<double>]'
  179 |     X = solver().solve(B);
      |     ~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h:142:29:   required from 'bool CGAL::Polygon_mesh_processing::internal::Shape_smoother<TriangleMesh, VertexPointMap, VertexConstraintMap, SparseLinearSolver, GeomTraits>::solve_system(const Eigen_matrix&, Eigen_vector&, Eigen_vector&, Eigen_vector&, const Eigen_vector&, const Eigen_vector&, const Eigen_vector&, SparseLinearSolver&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; VertexConstraintMap = CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >; GeomTraits = CGAL::Epick; Eigen_matrix = CGAL::Eigen_sparse_matrix<double>; Eigen_vector = CGAL::Eigen_vector<double>]'
  142 |     if(!solver.linear_solver(bx, Xx) ||
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:194:29:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  194 |     if(smoother.solve_system(A, Xx, Xy, Xz, bx, by, bz, solver))
      |        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::TriangularView<const Eigen::SparseMatrix<double, 1, int>, 5> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseTriangularView.h:25:56:   required from 'class Eigen::TriangularViewImpl<const Eigen::SparseMatrix<double, 1, int>, 5, Eigen::Sparse>'
   25 | template<typename MatrixType, unsigned int Mode> class TriangularViewImpl<MatrixType,Mode,Sparse>
      |                                                        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:187:58:   required from 'class Eigen::TriangularView<const Eigen::SparseMatrix<double, 1, int>, 5>'
  187 | template<typename _MatrixType, unsigned int _Mode> class TriangularView
      |                                                          ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h:174:50:   required from 'void Eigen::IncompleteLUT<_Scalar, _StorageIndex>::_solve_impl(const Rhs&, Dest&) const [with Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; _Scalar = double; _StorageIndex = int]'
  174 |       x = m_lu.template triangularView<UnitLower>().solve(x);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:147:26:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::Solve<DecType, RhsType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::IncompleteLUT<double>; RhsType = Eigen::Matrix<double, -1, 1>; Scalar = double; SrcXprType = Eigen::Solve<Eigen::IncompleteLUT<double>, Eigen::Matrix<double, -1, 1> >]'
  147 |     src.dec()._solve_impl(src.rhs(), dst);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::IncompleteLUT<double>, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:858:27:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:179:7:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::linear_solver(const Vector&, Vector&) [with EigenSolverT = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >; Vector = CGAL::Eigen_vector<double>]'
  179 |     X = solver().solve(B);
      |     ~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h:142:29:   required from 'bool CGAL::Polygon_mesh_processing::internal::Shape_smoother<TriangleMesh, VertexPointMap, VertexConstraintMap, SparseLinearSolver, GeomTraits>::solve_system(const Eigen_matrix&, Eigen_vector&, Eigen_vector&, Eigen_vector&, const Eigen_vector&, const Eigen_vector&, const Eigen_vector&, SparseLinearSolver&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; VertexConstraintMap = CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >; GeomTraits = CGAL::Epick; Eigen_matrix = CGAL::Eigen_sparse_matrix<double>; Eigen_vector = CGAL::Eigen_vector<double>]'
  142 |     if(!solver.linear_solver(bx, Xx) ||
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:194:29:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  194 |     if(smoother.solve_system(A, Xx, Xy, Xz, bx, by, bz, solver))
      |        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::TriangularView<const Eigen::SparseMatrix<double, 1, int>, 5>, Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::TriangularView<const Eigen::SparseMatrix<double, 1, int>, 5>, Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::TriangularView<const Eigen::SparseMatrix<double, 1, int>, 5>, Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::TriangularView<const Eigen::SparseMatrix<double, 1, int>, 5>, Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::TriangularView<const Eigen::SparseMatrix<double, 1, int>, 5>, Eigen::Matrix<double, -1, 1> >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h:174:58:   required from 'void Eigen::IncompleteLUT<_Scalar, _StorageIndex>::_solve_impl(const Rhs&, Dest&) const [with Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; _Scalar = double; _StorageIndex = int]'
  174 |       x = m_lu.template triangularView<UnitLower>().solve(x);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:147:26:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:179:7:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::linear_solver(const Vector&, Vector&) [with EigenSolverT = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >; Vector = CGAL::Eigen_vector<double>]'
  179 |     X = solver().solve(B);
      |     ~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h:142:29:   required from 'bool CGAL::Polygon_mesh_processing::internal::Shape_smoother<TriangleMesh, VertexPointMap, VertexConstraintMap, SparseLinearSolver, GeomTraits>::solve_system(const Eigen_matrix&, Eigen_vector&, Eigen_vector&, Eigen_vector&, const Eigen_vector&, const Eigen_vector&, const Eigen_vector&, SparseLinearSolver&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; VertexConstraintMap = CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >; GeomTraits = CGAL::Epick; Eigen_matrix = CGAL::Eigen_sparse_matrix<double>; Eigen_vector = CGAL::Eigen_vector<double>]'
  142 |     if(!solver.linear_solver(bx, Xx) ||
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:194:29:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  194 |     if(smoother.solve_system(A, Xx, Xy, Xz, bx, by, bz, solver))
      |        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::TriangularView<const Eigen::SparseMatrix<double, 1, int>, 2> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseTriangularView.h:25:56:   required from 'class Eigen::TriangularViewImpl<const Eigen::SparseMatrix<double, 1, int>, 2, Eigen::Sparse>'
   25 | template<typename MatrixType, unsigned int Mode> class TriangularViewImpl<MatrixType,Mode,Sparse>
      |                                                        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:187:58:   required from 'class Eigen::TriangularView<const Eigen::SparseMatrix<double, 1, int>, 2>'
  187 | template<typename _MatrixType, unsigned int _Mode> class TriangularView
      |                                                          ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h:175:46:   required from 'void Eigen::IncompleteLUT<_Scalar, _StorageIndex>::_solve_impl(const Rhs&, Dest&) const [with Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; _Scalar = double; _StorageIndex = int]'
  175 |       x = m_lu.template triangularView<Upper>().solve(x);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:147:26:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::Solve<DecType, RhsType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::IncompleteLUT<double>; RhsType = Eigen::Matrix<double, -1, 1>; Scalar = double; SrcXprType = Eigen::Solve<Eigen::IncompleteLUT<double>, Eigen::Matrix<double, -1, 1> >]'
  147 |     src.dec()._solve_impl(src.rhs(), dst);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::Solve<Eigen::IncompleteLUT<double>, Eigen::Matrix<double, -1, 1> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:858:27:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:179:7:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::linear_solver(const Vector&, Vector&) [with EigenSolverT = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >; Vector = CGAL::Eigen_vector<double>]'
  179 |     X = solver().solve(B);
      |     ~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h:142:29:   required from 'bool CGAL::Polygon_mesh_processing::internal::Shape_smoother<TriangleMesh, VertexPointMap, VertexConstraintMap, SparseLinearSolver, GeomTraits>::solve_system(const Eigen_matrix&, Eigen_vector&, Eigen_vector&, Eigen_vector&, const Eigen_vector&, const Eigen_vector&, const Eigen_vector&, SparseLinearSolver&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; VertexConstraintMap = CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >; GeomTraits = CGAL::Epick; Eigen_matrix = CGAL::Eigen_sparse_matrix<double>; Eigen_vector = CGAL::Eigen_vector<double>]'
  142 |     if(!solver.linear_solver(bx, Xx) ||
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:194:29:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  194 |     if(smoother.solve_system(A, Xx, Xy, Xz, bx, by, bz, solver))
      |        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::TriangularView<const Eigen::SparseMatrix<double, 1, int>, 2>, Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::TriangularView<const Eigen::SparseMatrix<double, 1, int>, 2>, Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::TriangularView<const Eigen::SparseMatrix<double, 1, int>, 2>, Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::TriangularView<const Eigen::SparseMatrix<double, 1, int>, 2>, Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::TriangularView<const Eigen::SparseMatrix<double, 1, int>, 2>, Eigen::Matrix<double, -1, 1> >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h:175:54:   required from 'void Eigen::IncompleteLUT<_Scalar, _StorageIndex>::_solve_impl(const Rhs&, Dest&) const [with Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; _Scalar = double; _StorageIndex = int]'
  175 |       x = m_lu.template triangularView<Upper>().solve(x);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:147:26:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:179:7:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::linear_solver(const Vector&, Vector&) [with EigenSolverT = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >; Vector = CGAL::Eigen_vector<double>]'
  179 |     X = solver().solve(B);
      |     ~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h:142:29:   required from 'bool CGAL::Polygon_mesh_processing::internal::Shape_smoother<TriangleMesh, VertexPointMap, VertexConstraintMap, SparseLinearSolver, GeomTraits>::solve_system(const Eigen_matrix&, Eigen_vector&, Eigen_vector&, Eigen_vector&, const Eigen_vector&, const Eigen_vector&, const Eigen_vector&, SparseLinearSolver&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; VertexConstraintMap = CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >; GeomTraits = CGAL::Epick; Eigen_matrix = CGAL::Eigen_sparse_matrix<double>; Eigen_vector = CGAL::Eigen_vector<double>]'
  142 |     if(!solver.linear_solver(bx, Xx) ||
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:194:29:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  194 |     if(smoother.solve_system(A, Xx, Xy, Xz, bx, by, bz, solver))
      |        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 26 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:179:7:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::linear_solver(const Vector&, Vector&) [with EigenSolverT = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >; Vector = CGAL::Eigen_vector<double>]'
  179 |     X = solver().solve(B);
      |     ~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h:142:29:   required from 'bool CGAL::Polygon_mesh_processing::internal::Shape_smoother<TriangleMesh, VertexPointMap, VertexConstraintMap, SparseLinearSolver, GeomTraits>::solve_system(const Eigen_matrix&, Eigen_vector&, Eigen_vector&, Eigen_vector&, const Eigen_vector&, const Eigen_vector&, const Eigen_vector&, SparseLinearSolver&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; VertexConstraintMap = CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >; GeomTraits = CGAL::Epick; Eigen_matrix = CGAL::Eigen_sparse_matrix<double>; Eigen_vector = CGAL::Eigen_vector<double>]'
  142 |     if(!solver.linear_solver(bx, Xx) ||
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:194:29:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  194 |     if(smoother.solve_system(A, Xx, Xy, Xz, bx, by, bz, solver))
      |        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false>, 1>'
  223 | template<typename Derived> class MapBase<Derived, WriteAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<Eigen::Matrix<double, -1, 1>, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:179:7:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::linear_solver(const Vector&, Vector&) [with EigenSolverT = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >; Vector = CGAL::Eigen_vector<double>]'
  179 |     X = solver().solve(B);
      |     ~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h:142:29:   required from 'bool CGAL::Polygon_mesh_processing::internal::Shape_smoother<TriangleMesh, VertexPointMap, VertexConstraintMap, SparseLinearSolver, GeomTraits>::solve_system(const Eigen_matrix&, Eigen_vector&, Eigen_vector&, Eigen_vector&, const Eigen_vector&, const Eigen_vector&, const Eigen_vector&, SparseLinearSolver&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; VertexConstraintMap = CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >; GeomTraits = CGAL::Epick; Eigen_matrix = CGAL::Eigen_sparse_matrix<double>; Eigen_vector = CGAL::Eigen_vector<double>]'
  142 |     if(!solver.linear_solver(bx, Xx) ||
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:194:29:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  194 |     if(smoother.solve_system(A, Xx, Xy, Xz, bx, by, bz, solver))
      |        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:179:7:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::linear_solver(const Vector&, Vector&) [with EigenSolverT = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >; Vector = CGAL::Eigen_vector<double>]'
  179 |     X = solver().solve(B);
      |     ~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h:142:29:   required from 'bool CGAL::Polygon_mesh_processing::internal::Shape_smoother<TriangleMesh, VertexPointMap, VertexConstraintMap, SparseLinearSolver, GeomTraits>::solve_system(const Eigen_matrix&, Eigen_vector&, Eigen_vector&, Eigen_vector&, const Eigen_vector&, const Eigen_vector&, const Eigen_vector&, SparseLinearSolver&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; VertexConstraintMap = CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >; GeomTraits = CGAL::Epick; Eigen_matrix = CGAL::Eigen_sparse_matrix<double>; Eigen_vector = CGAL::Eigen_vector<double>]'
  142 |     if(!solver.linear_solver(bx, Xx) ||
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:194:29:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  194 |     if(smoother.solve_system(A, Xx, Xy, Xz, bx, by, bz, solver))
      |        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, -1, 1>, 1, 1, false>; Functor = swap_assign_op<double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, -1, 1>, 1, 1, false>; Functor = Eigen::internal::swap_assign_op<double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, -1, 1>, 1, 1, false>; Func = swap_assign_op<double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, -1, 1>, 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, false>; Derived = Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false>]'
  424 |       call_assignment(derived(), other.const_cast_derived(), internal::swap_assign_op<Scalar>());
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:1033:18:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:179:7:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::linear_solver(const Vector&, Vector&) [with EigenSolverT = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >; Vector = CGAL::Eigen_vector<double>]'
  179 |     X = solver().solve(B);
      |     ~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h:142:29:   required from 'bool CGAL::Polygon_mesh_processing::internal::Shape_smoother<TriangleMesh, VertexPointMap, VertexConstraintMap, SparseLinearSolver, GeomTraits>::solve_system(const Eigen_matrix&, Eigen_vector&, Eigen_vector&, Eigen_vector&, const Eigen_vector&, const Eigen_vector&, const Eigen_vector&, SparseLinearSolver&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; VertexConstraintMap = CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >; GeomTraits = CGAL::Epick; Eigen_matrix = CGAL::Eigen_sparse_matrix<double>; Eigen_vector = CGAL::Eigen_vector<double>]'
  142 |     if(!solver.linear_solver(bx, Xx) ||
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:194:29:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  194 |     if(smoother.solve_system(A, Xx, Xy, Xz, bx, by, bz, solver))
      |        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/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);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Assign.h:66:28:   [ skipping 23 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::Solve<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >, Eigen::Matrix<double, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:179:7:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::linear_solver(const Vector&, Vector&) [with EigenSolverT = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> >; Vector = CGAL::Eigen_vector<double>]'
  179 |     X = solver().solve(B);
      |     ~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h:142:29:   required from 'bool CGAL::Polygon_mesh_processing::internal::Shape_smoother<TriangleMesh, VertexPointMap, VertexConstraintMap, SparseLinearSolver, GeomTraits>::solve_system(const Eigen_matrix&, Eigen_vector&, Eigen_vector&, Eigen_vector&, const Eigen_vector&, const Eigen_vector&, const Eigen_vector&, SparseLinearSolver&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; VertexConstraintMap = CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int>, Eigen::IncompleteLUT<double> > >; GeomTraits = CGAL::Epick; Eigen_matrix = CGAL::Eigen_sparse_matrix<double>; Eigen_vector = CGAL::Eigen_vector<double>]'
  142 |     if(!solver.linear_solver(bx, Xx) ||
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/smooth_shape.h:194:29:   required from 'void CGAL::Polygon_mesh_processing::smooth_shape(const FaceRange&, TriangleMesh&, double, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = std::__cxx11::list<CGAL::SM_Face_index>; NamedParameters = CGAL::Named_function_parameters<CGAL::Boolean_property_map<std::set<CGAL::SM_Vertex_index> >, CGAL::internal_np::vertex_is_constrained_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> >]'
  194 |     if(smoother.solve_system(A, Xx, Xy, Xz, bx, by, bz, solver))
      |        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_smooth.cpp:63:33:   required from here
   63 |         PMP::smooth_shape<Mesh3>(selectedFaces, mesh, time,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
   64 |                                  PMP::parameters::number_of_iterations(nIter)
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   65 |                                  .vertex_is_constrained_map(vcmap));
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
g++  -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.7/BH/include' -I'D:/RCompile/CRANpkg/lib/4.7/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"   -DCGAL_HEADER_ONLY=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c export_repair.cpp -o export_repair.o
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:205,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dimension.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Bbox_2.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic_classes.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
                 from SurfaceMesh.h:17,
                 from export_repair.cpp:14:
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                       ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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) {
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:174:
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/bind.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian_converter.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Filtered_kernel.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:21:
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/property_map.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
                 from SurfaceMesh.h:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/std_thread.h:43,
                 from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/thread:45,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/config.h:428,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20:
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/scoped_ptr.hpp:13,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/adjacency_list.hpp:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/split_graph_into_polylines.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Triangulation_2/internal/CTP2_subconstraint_graph.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Constrained_triangulation_plus_2.h:25,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Conforming_constrained_Delaunay_triangulation_3.h:38,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/make_conforming_constrained_Delaunay_triangulation_3.h:17,
                 from export_repair.cpp:17:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/scoped_ptr.hpp:63:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   63 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/QR:35,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Dense:4,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_matrix.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:30,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:26,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_faces.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Conforming_constrained_Delaunay_triangulation_3.h:86:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/FullPivHouseholderQR.h: In member function 'void Eigen::FullPivHouseholderQR<MatrixType>::computeInPlace()':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/FullPivHouseholderQR.h:496: note: '-Wmisleading-indentation' is disabled from this point onwards, since column-tracking was disabled due to the size of the code/headers
  496 |     if(k==0) biggest = biggest_in_corner;
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/QR/FullPivHouseholderQR.h:496: note: adding '-flarge-source-files' will allow for more column-tracking support, at the expense of compilation time and memory
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:165:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<float, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:0:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<float> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:0:   required from here
   24 |     ResAlignment = traits<Quaternion<float> >::Alignment
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:271:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<float, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<float, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:0:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<float> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:0:   required from 'class Eigen::Quaternion<float>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:0:   required from here
   27 |   {
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:0:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<double> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:0:   required from here
   98 |     ResAlignment = traits<Quaternion<double> >::Alignment
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:0:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<double> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:0:   required from 'class Eigen::Quaternion<double>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:0:   required from here
  102 |   {
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/SparseCore:37,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Sparse:26,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:20:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::SparseMatrix<double, 0, int> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7:   required from 'class Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 0, int> >'
   36 | class SparseCompressedBase
      |       ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7:   required from 'class Eigen::SparseMatrix<double, 0, int>'
   96 | class SparseMatrix
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:293:21:   required from 'struct CGAL::Eigen_sparse_matrix<double>'
  293 |   mutable EigenType m_matrix;
      |                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:99:0:   required from here
   99 | template<class EigenSolverT = Eigen::BiCGSTAB<Eigen_sparse_matrix<double>::EigenType> >
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7:   required from 'class Eigen::SparseCompressedBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >'
   36 | class SparseCompressedBase
      |       ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMap.h:50:7:   required from 'class Eigen::SparseMapBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 0>'
   50 | class SparseMapBase<Derived,ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:83:34:   required from 'class Eigen::internal::SparseRefBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >'
   83 | template<typename Derived> class SparseRefBase
      |                                  ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:177:7:   required from 'class Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >'
  177 | class Ref<const SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:37:41:   required from 'struct Eigen::internal::is_ref_compatible_impl<Eigen::SparseMatrix<double, 0, int> >'
   37 |   enum { value = sizeof(test<MatrixType>(ms_from, 0))==sizeof(yes) };
      |                        ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:43:81:   required from 'struct Eigen::internal::is_ref_compatible<Eigen::SparseMatrix<double, 0, int> >'
   43 |   enum { value = is_ref_compatible_impl<typename remove_all<MatrixType>::type>::value };
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:46:49:   required from 'class Eigen::IterativeSolverBase<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> > >'
   46 | template<typename MatrixType, bool MatrixFree = !internal::is_ref_compatible<MatrixType>::value>
      |                                                 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:158:7:   required from 'class Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >'
  158 | class BiCGSTAB : public IterativeSolverBase<BiCGSTAB<_MatrixType,_Preconditioner> >
      |       ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:239:0:   required from here
  239 |   typedef EigenSolverT::Scalar                                          Scalar;
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, -1>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, -1, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h:41:43:   required from 'class Eigen::DiagonalPreconditioner<double>'
   41 |     typedef typename Vector::StorageIndex StorageIndex;
      |                                           ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:431:18:   required from 'class Eigen::IterativeSolverBase<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> > >'
  431 |   Preconditioner m_preconditioner;
      |                  ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:158:7:   required from 'class Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >'
  158 | class BiCGSTAB : public IterativeSolverBase<BiCGSTAB<_MatrixType,_Preconditioner> >
      |       ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:239:0:   required from here
  239 |   typedef EigenSolverT::Scalar                                          Scalar;
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, -1, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h:41:43:   required from 'class Eigen::DiagonalPreconditioner<double>'
   41 |     typedef typename Vector::StorageIndex StorageIndex;
      |                                           ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:431:18:   required from 'class Eigen::IterativeSolverBase<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> > >'
  431 |   Preconditioner m_preconditioner;
      |                  ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:158:7:   required from 'class Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >'
  158 | class BiCGSTAB : public IterativeSolverBase<BiCGSTAB<_MatrixType,_Preconditioner> >
      |       ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:239:0:   required from here
  239 |   typedef EigenSolverT::Scalar                                          Scalar;
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:41:7:   required from 'class Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >'
   41 | class SolveWithGuess : public internal::generic_xpr_base<SolveWithGuess<Decomposition,RhsType,GuessType>, MatrixXpr, typename internal::traits<RhsType>::StorageKind>::type
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/assert.hpp:35,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:31,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:20:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/int.hpp:20,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda_fwd.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_spec.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/or.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/type_traits.h:16,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Algebraic_structure_traits.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/number_type_basic.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:28:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function 'boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~VertexListGraphConcept()'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro 'BOOST_concept'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from 'struct boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function 'boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~EdgeListGraphConcept()'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro 'BOOST_concept'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function 'boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~IncidenceGraphConcept()'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro 'BOOST_concept'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:960:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::typed_identity_property_map<long long unsigned int>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Matrix<double, -1, 1>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:717:21:   required from 'Derived& Eigen::PlainObjectBase<Derived>::setOnes(Eigen::Index) [with Derived = Eigen::Matrix<double, -1, 1>; Eigen::Index = long long int]'
  717 |   return setConstant(Scalar(1));
      |          ~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:276:0:   required from here
  276 |     X.setOnes(B.rows());
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::Map<Eigen::SparseMatrix<double, 0, int>, 0, Eigen::Stride<0, 0> > >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7:   required from 'class Eigen::SparseCompressedBase<Eigen::Map<Eigen::SparseMatrix<double, 0, int>, 0, Eigen::Stride<0, 0> > >'
   36 | class SparseCompressedBase
      |       ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMap.h:50:7:   required from 'class Eigen::SparseMapBase<Eigen::Map<Eigen::SparseMatrix<double, 0, int>, 0, Eigen::Stride<0, 0> >, 0>'
   50 | class SparseMapBase<Derived,ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMap.h:148:7:   required from 'class Eigen::SparseMapBase<Eigen::Map<Eigen::SparseMatrix<double, 0, int>, 0, Eigen::Stride<0, 0> >, 1>'
  148 | class SparseMapBase<Derived,WriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMap.h:222:7:   required from 'class Eigen::Map<Eigen::SparseMatrix<double, 0, int>, 0, Eigen::Stride<0, 0> >'
  222 | class Map<SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/MappedSparseMatrix.h:32:7:   required from 'class Eigen::MappedSparseMatrix<double, 0, int>'
   32 | class MappedSparseMatrix
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU.h:477:54:   required from 'class Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> >'
  477 |     MappedSparseMatrix<Scalar,ColMajor,StorageIndex> m_Ustore; // The upper triangular matrix
      |                                                      ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:102:0:   required from 'class CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >'
  102 |   typedef typename EigenSolverT::Scalar                               Scalar;
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:176:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  182 |     BOOST_CONCEPT_USAGE(VertexListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from 'struct boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:148:7:   required from 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:208:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:148:7:   required from 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::typed_identity_property_map<long long unsigned int>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function 'boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~VertexListGraphConcept()'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro 'BOOST_concept'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from 'struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function 'boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~EdgeListGraphConcept()'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro 'BOOST_concept'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function 'boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~IncidenceGraphConcept()'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro 'BOOST_concept'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, void*>, const boost::detail::edge_desc_impl<boost::directed_tag, void*>&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_reverse_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:960:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, void*>, const boost::detail::edge_desc_impl<boost::directed_tag, void*>&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_reverse_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, boost::vertex_index_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, boost::vertex_index_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:180:7:   required from 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function 'boost::RandomAccessIteratorConcept<std::_Bit_iterator>::~RandomAccessIteratorConcept()'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro 'BOOST_concept'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function 'boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >::~RandomAccessIteratorConcept()'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro 'BOOST_concept'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::SparseMatrix<double, 1, int> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7:   required from 'class Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 1, int> >'
   36 | class SparseCompressedBase
      |       ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7:   required from 'class Eigen::SparseMatrix<double, 1, int>'
   96 | class SparseMatrix
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1040:66:   required from 'void Eigen::internal::set_from_triplets(const InputIterator&, const InputIterator&, SparseMatrixType&, DupFunctor) [with InputIterator = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; SparseMatrixType = Eigen::SparseMatrix<double, 0, int>; DupFunctor = scalar_sum_op<double, double>]'
 1040 |   SparseMatrix<Scalar,IsRowMajor?ColMajor:RowMajor,StorageIndex> trMat(mat.rows(),mat.cols());
      |                                                                  ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1110:92:   required from 'void Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::setFromTriplets(const InputIterators&, const InputIterators&) [with InputIterators = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1110 |   internal::set_from_triplets<InputIterators, SparseMatrix<Scalar,_Options,_StorageIndex> >(begin, end, *this, internal::scalar_sum_op<Scalar,Scalar>());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:239:29:   required from 'void CGAL::Eigen_sparse_matrix<T>::assemble_matrix() const [with T = double]'
  239 |     m_matrix.setFromTriplets(m_triplets.begin(), m_triplets.end());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:249:7:   required from 'const CGAL::Eigen_sparse_matrix<T>::EigenType& CGAL::Eigen_sparse_matrix<T>::eigen_object() const [with T = double; EigenType = Eigen::SparseMatrix<double, 0, int>]'
  249 |       assemble_matrix();
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:271:0:   required from here
  271 |     m_solver_sptr->compute(A.eigen_object());
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:127:16:   required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >'
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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> >]':
D:/RCompile/CRANpkg/lib/4.7/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>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/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)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/iterator/iterator_concepts.hpp:106:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/iterator/iterator_concepts.hpp:106:7:   required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13:   required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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> >]':
D:/RCompile/CRANpkg/lib/4.7/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>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/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)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:154:13:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:154:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:280:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:280:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:280:9:   required from 'struct boost::SinglePassRangeConcept<std::vector<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::vector<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:127:16:   required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >'
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13:   required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:283:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:283:9:   required from 'struct boost::SinglePassRangeConcept<std::vector<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::vector<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:286:9:   required from 'struct boost::SinglePassRangeConcept<std::vector<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::vector<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SinglePassRangeConcept<std::vector<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = std::vector<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:286:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  286 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  182 |     BOOST_CONCEPT_USAGE(VertexListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from 'struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Comparable<TT>::~Comparable() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::SparseMatrix<double, 1, int>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80:   required from 'struct Eigen::internal::evaluator<Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 1, int> > >'
  336 |   typedef typename DenseCoeffsBase<Derived,ReadOnlyAccessors>::CoeffReturnType CoeffReturnType;
      |                                                                                ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8:   required from 'struct Eigen::internal::evaluator<Eigen::SparseMatrix<double, 1, int> >'
 1505 | struct evaluator<SparseMatrix<_Scalar,_Options,_StorageIndex> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1181:93:   required from 'Eigen::SparseMatrix<_Scalar, _Options, _StorageIndex>& Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::operator=(const Eigen::SparseMatrixBase<OtherDerived>&) [with OtherDerived = Eigen::SparseMatrix<double, 1, int>; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1181 |   const bool needToTranspose = (Flags & RowMajorBit) != (internal::evaluator<OtherDerived>::Flags & RowMajorBit);
      |                                                                                             ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1063:7:   required from 'void Eigen::internal::set_from_triplets(const InputIterator&, const InputIterator&, SparseMatrixType&, DupFunctor) [with InputIterator = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; SparseMatrixType = Eigen::SparseMatrix<double, 0, int>; DupFunctor = scalar_sum_op<double, double>]'
 1063 |   mat = trMat;
      |   ~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1110:92:   required from 'void Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::setFromTriplets(const InputIterators&, const InputIterators&) [with InputIterators = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1110 |   internal::set_from_triplets<InputIterators, SparseMatrix<Scalar,_Options,_StorageIndex> >(begin, end, *this, internal::scalar_sum_op<Scalar,Scalar>());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:239:29:   required from 'void CGAL::Eigen_sparse_matrix<T>::assemble_matrix() const [with T = double]'
  239 |     m_matrix.setFromTriplets(m_triplets.begin(), m_triplets.end());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:249:7:   required from 'const CGAL::Eigen_sparse_matrix<T>::EigenType& CGAL::Eigen_sparse_matrix<T>::eigen_object() const [with T = double; EigenType = Eigen::SparseMatrix<double, 0, int>]'
  249 |       assemble_matrix();
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:271:0:   required from here
  271 |     m_solver_sptr->compute(A.eigen_object());
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> >, Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> >, Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> >, Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> >, Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> >, Eigen::Matrix<double, -1, 1> >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:179:0:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::linear_solver(const Vector&, Vector&) [with EigenSolverT = Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> >; Vector = CGAL::Eigen_vector<double>]'
  179 |     X = solver().solve(B);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:127:16:   required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >'
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13:   required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  138 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long long unsigned int*, std::vector<long long unsigned int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:127:16:   required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >'
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13:   required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:138:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  138 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:149:16:   required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >'
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13:   required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long long unsigned int*, std::vector<long long unsigned int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:286:9:   required from 'struct boost::SinglePassRangeConcept<std::vector<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::vector<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/size.hpp:62:9:   required from 'typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<long long unsigned int>; typename range_size<const SinglePassRange>::type = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:0:   required from 'bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::vector<long long unsigned int> >]'
  211 |     std::size_t nb_edges = boost::size(polygon);
export_repair.cpp:104:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
  104 |   if(!PMP::is_polygon_soup_a_polygon_mesh(polygons)) {
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = std::vector<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/range/concepts.hpp:286:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  286 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:603:11:   required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:603:11:   required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<void*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<void*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<void*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long long int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:514:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:109:22: note: in a call to non-static member function 'boost::SignedInteger<long long int>::~SignedInteger()'
  109 |   template <> struct SignedInteger< ::boost::long_long_type> {};
      |                      ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:545:11:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:545:11:   required from 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:573:11:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:573:11:   required from 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:603:11:   required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Ref<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Ref<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Ref<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<1> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:277:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Ref.h:44:50:   required from 'struct Eigen::internal::traits<Eigen::Ref<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<1> > >::match<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false> >'
   44 |       DerivedAlignment = int(evaluator<Derived>::Alignment),
      |                                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::InnerStride<1> >::Ref(const Eigen::DenseBase<Derived>&, typename Eigen::internal::enable_if<(bool)(Eigen::internal::traits<Eigen::Ref<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<1> > >::match<Derived>::MatchAtCompileTime), Derived>::type*) [with Derived = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>]'
  288 |                                  typename internal::enable_if<bool(Traits::template match<Derived>::MatchAtCompileTime),Derived>::type* = 0);
      |                                                                                                     ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU.h:732:31:   required from 'void Eigen::SparseLU<_MatrixType, _OrderingType>::factorize(const MatrixType&) [with _MatrixType = Eigen::SparseMatrix<double, 0, int>; _OrderingType = Eigen::COLAMDOrdering<int>; MatrixType = Eigen::SparseMatrix<double, 0, int>]'
  732 |       info = Base::column_bmod(jj, (nseg - nseg1), dense_k, tempv, segrep_k, repfnz_k, jcol, m_glu);
      |              ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU.h:187:7:   required from 'void Eigen::SparseLU<_MatrixType, _OrderingType>::compute(const MatrixType&) [with _MatrixType = Eigen::SparseMatrix<double, 0, int>; _OrderingType = Eigen::COLAMDOrdering<int>; MatrixType = Eigen::SparseMatrix<double, 0, int>]'
  187 |       factorize(matrix);
      |       ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:169:0:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::factor(const Matrix&, NT&) [with EigenSolverT = Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> >; Matrix = CGAL::Eigen_sparse_matrix<double>; NT = double]'
  169 |     solver().compute(*m_mat);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<std::_List_iterator<void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::SparseMatrix<double, 0, int>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80:   required from 'struct Eigen::internal::evaluator<Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 0, int> > >'
  336 |   typedef typename DenseCoeffsBase<Derived,ReadOnlyAccessors>::CoeffReturnType CoeffReturnType;
      |                                                                                ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8:   required from 'struct Eigen::internal::evaluator<Eigen::SparseMatrix<double, 0, int> >'
 1505 | struct evaluator<SparseMatrix<_Scalar,_Options,_StorageIndex> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:79:45:   required from 'void Eigen::internal::assign_sparse_to_sparse(DstXprType&, const SrcXprType&) [with DstXprType = Eigen::SparseMatrix<double, 0, int>; SrcXprType = Eigen::SparseMatrix<double, 1, int>]'
   79 |   const bool transpose = (DstEvaluatorType::Flags & RowMajorBit) != (SrcEvaluatorType::Flags & RowMajorBit);
      |                                             ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:132:28:   required from 'static void Eigen::internal::Assignment<DstXprType, SrcXprType, Functor, Eigen::internal::Sparse2Sparse>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<typename DstXprType::Scalar, typename SrcXprType::Scalar>&) [with DstXprType = Eigen::SparseMatrix<double, 0, int>; SrcXprType = Eigen::SparseMatrix<double, 1, int>; Functor = Eigen::internal::assign_op<double, double>; typename DstXprType::Scalar = double; typename SrcXprType::Scalar = double]'
  132 |     assign_sparse_to_sparse(dst.derived(), src.derived());
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:38:16:   required from 'Derived& Eigen::SparseMatrixBase<Derived>::operator=(const Eigen::SparseMatrixBase<OtherDerived>&) [with OtherDerived = Eigen::SparseMatrix<double, 1, int>; Derived = Eigen::SparseMatrix<double, 0, int>]'
   37 |   internal::Assignment<Derived,OtherDerived,internal::assign_op<Scalar,typename OtherDerived::Scalar> >
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   38 |           ::run(derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |           ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1239:27:   required from 'Eigen::SparseMatrix<_Scalar, _Options, _StorageIndex>& Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::operator=(const Eigen::SparseMatrixBase<OtherDerived>&) [with OtherDerived = Eigen::SparseMatrix<double, 1, int>; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1239 |     return Base::operator=(other.derived());
      |            ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1063:7:   required from 'void Eigen::internal::set_from_triplets(const InputIterator&, const InputIterator&, SparseMatrixType&, DupFunctor) [with InputIterator = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; SparseMatrixType = Eigen::SparseMatrix<double, 0, int>; DupFunctor = scalar_sum_op<double, double>]'
 1063 |   mat = trMat;
      |   ~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1110:92:   required from 'void Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::setFromTriplets(const InputIterators&, const InputIterators&) [with InputIterators = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1110 |   internal::set_from_triplets<InputIterators, SparseMatrix<Scalar,_Options,_StorageIndex> >(begin, end, *this, internal::scalar_sum_op<Scalar,Scalar>());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:239:29:   required from 'void CGAL::Eigen_sparse_matrix<T>::assemble_matrix() const [with T = double]'
  239 |     m_matrix.setFromTriplets(m_triplets.begin(), m_triplets.end());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:249:7:   required from 'const CGAL::Eigen_sparse_matrix<T>::EigenType& CGAL::Eigen_sparse_matrix<T>::eigen_object() const [with T = double; EigenType = Eigen::SparseMatrix<double, 0, int>]'
  249 |       assemble_matrix();
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:271:0:   required from here
  271 |     m_solver_sptr->compute(A.eigen_object());
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:42:29:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:42:23:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   42 |   VectorType r  = rhs - mat * x;
      |                   ~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:27:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
      |                         ~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:23:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
      |                    ~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:18:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
      |             ~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:11:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
      |         ~~^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:85:22:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   85 |     y = precond.solve(p);
      |         ~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:100:20:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
  100 |     x += alpha * y + w * z;
      |          ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> > >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_panel_bmod.h:140:55:   required from 'void Eigen::internal::SparseLUImpl<Scalar, StorageIndex>::panel_bmod(Eigen::Index, Eigen::Index, Eigen::Index, Eigen::Index, ScalarVector&, ScalarVector&, IndexVector&, IndexVector&, GlobalLU_t&) [with Scalar = double; StorageIndex = int; Eigen::Index = long long int; ScalarVector = Eigen::Matrix<double, -1, 1>; IndexVector = Eigen::Matrix<int, -1, 1>; GlobalLU_t = Eigen::internal::LU_GlobalLU_t<Eigen::Matrix<int, -1, 1>, Eigen::Matrix<double, -1, 1> >]'
  140 |       U = A.template triangularView<UnitLower>().solve(U);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU.h:710:21:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false> >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_column_bmod.h:168:53:   required from 'Eigen::Index Eigen::internal::SparseLUImpl<Scalar, StorageIndex>::column_bmod(Eigen::Index, Eigen::Index, BlockScalarVector, ScalarVector&, BlockIndexVector, BlockIndexVector, Eigen::Index, GlobalLU_t&) [with Scalar = double; StorageIndex = int; Eigen::Index = long long int; BlockScalarVector = Eigen::Ref<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<1> >; ScalarVector = Eigen::Matrix<double, -1, 1>; BlockIndexVector = Eigen::Ref<Eigen::Matrix<int, -1, 1>, 0, Eigen::InnerStride<1> >; GlobalLU_t = Eigen::internal::LU_GlobalLU_t<Eigen::Matrix<int, -1, 1>, Eigen::Matrix<double, -1, 1> >]'
  168 |     u = A.template triangularView<UnitLower>().solve(u);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU.h:732:31:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_column_bmod.h:172:22:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Matrix<double, -1, 1>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:45:40:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:166:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/Memory.h: In instantiation of 'Index Eigen::internal::first_default_aligned(const Scalar*, Index) [with Scalar = double; Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_panel_bmod.h:148:65:   required from 'void Eigen::internal::SparseLUImpl<Scalar, StorageIndex>::panel_bmod(Eigen::Index, Eigen::Index, Eigen::Index, Eigen::Index, ScalarVector&, ScalarVector&, IndexVector&, IndexVector&, GlobalLU_t&) [with Scalar = double; StorageIndex = int; Eigen::Index = long long int; ScalarVector = Eigen::Matrix<double, -1, 1>; IndexVector = Eigen::Matrix<int, -1, 1>; GlobalLU_t = Eigen::internal::LU_GlobalLU_t<Eigen::Matrix<int, -1, 1>, Eigen::Matrix<double, -1, 1> >]'
  148 |       Index offset = (PacketSize-internal::first_default_aligned(B.data(), PacketSize)) % PacketSize;
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU.h:710:21:   required from 'void Eigen::SparseLU<_MatrixType, _OrderingType>::factorize(const MatrixType&) [with _MatrixType = Eigen::SparseMatrix<double, 0, int>; _OrderingType = Eigen::COLAMDOrdering<int>; MatrixType = Eigen::SparseMatrix<double, 0, int>]'
  710 |     Base::panel_bmod(m, panel_size, jcol, nseg1, dense, tempv, segrep, repfnz, m_glu);
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU.h:187:7:   required from 'void Eigen::SparseLU<_MatrixType, _OrderingType>::compute(const MatrixType&) [with _MatrixType = Eigen::SparseMatrix<double, 0, int>; _OrderingType = Eigen::COLAMDOrdering<int>; MatrixType = Eigen::SparseMatrix<double, 0, int>]'
  187 |       factorize(matrix);
      |       ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:169:0:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::factor(const Matrix&, NT&) [with EigenSolverT = Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> >; Matrix = CGAL::Eigen_sparse_matrix<double>; NT = double]'
  169 |     solver().compute(*m_mat);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/Memory.h:500:60: warning: ignoring attributes on template argument 'Eigen::internal::packet_traits<double>::type' {aka '__m128d'} [-Wignored-attributes]
  500 |   return first_aligned<unpacket_traits<DefaultPacketType>::alignment>(array, size);
      |                                                            ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Map.h:94:79:   required from 'class Eigen::Map<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> >'
   94 | template<typename PlainObjectType, int MapOptions, typename StrideType> class Map
      |                                                                               ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_gemm_kernel.h:261:78:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_gemm_kernel.h:261:76:   required from 'void Eigen::internal::sparselu_gemm(Eigen::Index, Eigen::Index, Eigen::Index, const Scalar*, Eigen::Index, const Scalar*, Eigen::Index, Scalar*, Eigen::Index) [with Scalar = double; Eigen::Index = long long int]'
  261 |         if(rd==1)       MapVector(C+j*ldc+ib,actual_b) += B[0+d_end+j*ldb] * ConstMapVector(A+(d_end+0)*lda+ib, actual_b);
      |                                                           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_panel_bmod.h:152:38:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_gemm_kernel.h:264:57:   required from 'void Eigen::internal::sparselu_gemm(Eigen::Index, Eigen::Index, Eigen::Index, const Scalar*, Eigen::Index, const Scalar*, Eigen::Index, Scalar*, Eigen::Index) [with Scalar = double; Eigen::Index = long long int]'
  263 |         else if(rd==2)  MapVector(C+j*ldc+ib,actual_b) += B[0+d_end+j*ldb] * ConstMapVector(A+(d_end+0)*lda+ib, actual_b)
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                                                         + B[1+d_end+j*ldb] * ConstMapVector(A+(d_end+1)*lda+ib, actual_b);
      |                                                         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_panel_bmod.h:152:38:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > > >, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > > >, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > > >, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > > >, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > > >, const 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<const Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_gemm_kernel.h:268:57:   required from 'void Eigen::internal::sparselu_gemm(Eigen::Index, Eigen::Index, Eigen::Index, const Scalar*, Eigen::Index, const Scalar*, Eigen::Index, Scalar*, Eigen::Index) [with Scalar = double; Eigen::Index = long long int]'
  266 |         else            MapVector(C+j*ldc+ib,actual_b) += B[0+d_end+j*ldb] * ConstMapVector(A+(d_end+0)*lda+ib, actual_b)
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  267 |                                                         + B[1+d_end+j*ldb] * ConstMapVector(A+(d_end+1)*lda+ib, actual_b)
      |                                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  268 |                                                         + B[2+d_end+j*ldb] * ConstMapVector(A+(d_end+2)*lda+ib, actual_b);
      |                                                         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_panel_bmod.h:152:38:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 2>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 2>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 2, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 2, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 2, 2> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 2>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 2, 1> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Map.h:18:8:   required from 'struct Eigen::internal::traits<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> > >'
   18 | struct traits<Map<PlainObjectType, MapOptions, StrideType> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:32:48:   required from 'struct Eigen::internal::accessors_level<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> > >'
   32 |   enum { has_direct_access = (traits<Derived>::Flags & DirectAccessBit) ? 1 : 0,
      |                                                ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:111:75:   required from 'class Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >'
  111 |          int Level = internal::accessors_level<Derived>::has_write_access ? WriteAccessors : ReadOnlyAccessors
      |                                                          ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_kernel_bmod.h:59:47:   required from 'static void Eigen::internal::LU_kernel_bmod<SegSizeAtCompileTime>::run(Eigen::Index, BlockScalarVector&, ScalarVector&, ScalarVector&, Eigen::Index&, Eigen::Index, Eigen::Index, IndexVector&, Eigen::Index, Eigen::Index) [with BlockScalarVector = Eigen::VectorBlock<Eigen::Matrix<double, -1, 1>, -1>; ScalarVector = Eigen::Matrix<double, -1, 1>; IndexVector = Eigen::Matrix<int, -1, 1>; int SegSizeAtCompileTime = 2; Eigen::Index = long long int]'
   59 |   Map<Matrix<Scalar,SegSizeAtCompileTime,1> > u(tempv.data(), segsize);
      |                                               ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_panel_bmod.h:210:53:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 2, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 2, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 2, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 2, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> > >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_kernel_bmod.h:61:51:   required from 'static void Eigen::internal::LU_kernel_bmod<SegSizeAtCompileTime>::run(Eigen::Index, BlockScalarVector&, ScalarVector&, ScalarVector&, Eigen::Index&, Eigen::Index, Eigen::Index, IndexVector&, Eigen::Index, Eigen::Index) [with BlockScalarVector = Eigen::VectorBlock<Eigen::Matrix<double, -1, 1>, -1>; ScalarVector = Eigen::Matrix<double, -1, 1>; IndexVector = Eigen::Matrix<int, -1, 1>; int SegSizeAtCompileTime = 2; Eigen::Index = long long int]'
   61 |   u = A.template triangularView<UnitLower>().solve(u);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_panel_bmod.h:210:53:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 2>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 2>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, -1, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, -1, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 2> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 2>, 0, Eigen::OuterStride<> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 2>, 0, Eigen::OuterStride<> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 2>, 0, Eigen::OuterStride<> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, -1, 2>, 0, Eigen::OuterStride<> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, -1, 2>, 0, Eigen::OuterStride<> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, -1, 2>, 0, Eigen::OuterStride<> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 9>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 3, 3> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Map.h:18:8:   required from 'struct Eigen::internal::traits<Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> > >'
   18 | struct traits<Map<PlainObjectType, MapOptions, StrideType> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:32:48:   required from 'struct Eigen::internal::accessors_level<Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> > >'
   32 |   enum { has_direct_access = (traits<Derived>::Flags & DirectAccessBit) ? 1 : 0,
      |                                                ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:111:75:   required from 'class Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >'
  111 |          int Level = internal::accessors_level<Derived>::has_write_access ? WriteAccessors : ReadOnlyAccessors
      |                                                          ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_kernel_bmod.h:58:94:   required from 'static void Eigen::internal::LU_kernel_bmod<SegSizeAtCompileTime>::run(Eigen::Index, BlockScalarVector&, ScalarVector&, ScalarVector&, Eigen::Index&, Eigen::Index, Eigen::Index, IndexVector&, Eigen::Index, Eigen::Index) [with BlockScalarVector = Eigen::VectorBlock<Eigen::Matrix<double, -1, 1>, -1>; ScalarVector = Eigen::Matrix<double, -1, 1>; IndexVector = Eigen::Matrix<int, -1, 1>; int SegSizeAtCompileTime = 3; Eigen::Index = long long int]'
   58 |   Map<Matrix<Scalar,SegSizeAtCompileTime,SegSizeAtCompileTime, ColMajor>, 0, OuterStride<> > A( &(lusup.data()[luptr]), segsize, segsize, OuterStride<>(lda) );
      |                                                                                              ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_panel_bmod.h:211:53:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 3>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 3, 3> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 3, 3> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 3>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57:   required from 'struct Eigen::internal::traits<Eigen::Matrix<double, 3, 1> >'
   22 |   typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Map.h:18:8:   required from 'struct Eigen::internal::traits<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> > >'
   18 | struct traits<Map<PlainObjectType, MapOptions, StrideType> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:32:48:   required from 'struct Eigen::internal::accessors_level<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> > >'
   32 |   enum { has_direct_access = (traits<Derived>::Flags & DirectAccessBit) ? 1 : 0,
      |                                                ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:111:75:   required from 'class Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >'
  111 |          int Level = internal::accessors_level<Derived>::has_write_access ? WriteAccessors : ReadOnlyAccessors
      |                                                          ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_kernel_bmod.h:59:47:   required from 'static void Eigen::internal::LU_kernel_bmod<SegSizeAtCompileTime>::run(Eigen::Index, BlockScalarVector&, ScalarVector&, ScalarVector&, Eigen::Index&, Eigen::Index, Eigen::Index, IndexVector&, Eigen::Index, Eigen::Index) [with BlockScalarVector = Eigen::VectorBlock<Eigen::Matrix<double, -1, 1>, -1>; ScalarVector = Eigen::Matrix<double, -1, 1>; IndexVector = Eigen::Matrix<int, -1, 1>; int SegSizeAtCompileTime = 3; Eigen::Index = long long int]'
   59 |   Map<Matrix<Scalar,SegSizeAtCompileTime,1> > u(tempv.data(), segsize);
      |                                               ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_panel_bmod.h:211:53:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 3, 1>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, 3, 1> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, 3, 1> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 1> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> > >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_kernel_bmod.h:61:51:   required from 'static void Eigen::internal::LU_kernel_bmod<SegSizeAtCompileTime>::run(Eigen::Index, BlockScalarVector&, ScalarVector&, ScalarVector&, Eigen::Index&, Eigen::Index, Eigen::Index, IndexVector&, Eigen::Index, Eigen::Index) [with BlockScalarVector = Eigen::VectorBlock<Eigen::Matrix<double, -1, 1>, -1>; ScalarVector = Eigen::Matrix<double, -1, 1>; IndexVector = Eigen::Matrix<int, -1, 1>; int SegSizeAtCompileTime = 3; Eigen::Index = long long int]'
   61 |   u = A.template triangularView<UnitLower>().solve(u);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_panel_bmod.h:211:53:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 3>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 3>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 3>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Matrix<double, -1, 3> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Matrix<double, -1, 3> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7:   required from 'class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3> >'
   98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 3>, 0, Eigen::OuterStride<> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 3>, 0, Eigen::OuterStride<> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 3>, 0, Eigen::OuterStride<> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, -1, 3>, 0, Eigen::OuterStride<> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, -1, 3>, 0, Eigen::OuterStride<> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, -1, 3>, 0, Eigen::OuterStride<> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::TriangularView<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_kernel_bmod.h:61:51:   required from 'static void Eigen::internal::LU_kernel_bmod<SegSizeAtCompileTime>::run(Eigen::Index, BlockScalarVector&, ScalarVector&, ScalarVector&, Eigen::Index&, Eigen::Index, Eigen::Index, IndexVector&, Eigen::Index, Eigen::Index) [with BlockScalarVector = Eigen::VectorBlock<Eigen::Matrix<double, -1, 1>, -1>; ScalarVector = Eigen::Matrix<double, -1, 1>; IndexVector = Eigen::Matrix<int, -1, 1>; int SegSizeAtCompileTime = -1; Eigen::Index = long long int]'
   61 |   u = A.template triangularView<UnitLower>().solve(u);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_panel_bmod.h:212:59:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_List_iterator<void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:44:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Matrix<double, -1, 1>; U = Eigen::Matrix<double, -1, 1>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10:   required from 'Derived& Eigen::DenseBase<Derived>::setZero() [with Derived = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >]'
  548 |   return setConstant(Scalar(0));
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_panel_bmod.h:151:16:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<1> >, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<1> >, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::InnerStride<1> >, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::PermutationMatrix<-1, -1, int>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::PermutationMatrix<-1, -1, int>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::PermutationMatrix<-1, -1, int>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::PermutationMatrix<-1, -1, int>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 2, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::PermutationMatrix<-1, -1, int>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 2, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::PermutationMatrix<-1, -1, int>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 2>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU.h:327:38:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Inverse<Eigen::PermutationMatrix<-1, -1, int> >, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 2>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Inverse<Eigen::PermutationMatrix<-1, -1, int> >, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 2> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Inverse<Eigen::PermutationMatrix<-1, -1, int> >, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 2> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Inverse<Eigen::PermutationMatrix<-1, -1, int> >, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 2, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Inverse<Eigen::PermutationMatrix<-1, -1, int> >, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 2, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Inverse<Eigen::PermutationMatrix<-1, -1, int> >, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 2>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU.h:335:48:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                                               ^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU.h:852:80:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 2>, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 2>, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 2>, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::TriangularView<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 2>, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::TriangularView<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 2>, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> > >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU.h:854:53:   required from 'void Eigen::SparseLUMatrixUReturnType<MatrixLType, MatrixUType>::solveInPlace(Eigen::MatrixBase<OtherDerived>&) const [with Dest = Eigen::Matrix<double, -1, 1>; MatrixLType = Eigen::internal::MappedSuperNodalMatrix<double, int>; MatrixUType = Eigen::MappedSparseMatrix<double, 0, int>]'
  854 |         U = A.template triangularView<Upper>().solve(U);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU.h:331:35:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:46:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Matrix<double, -1, 1>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:45:40:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   45 |   RealScalar r0_sqnorm = r0.squaredNorm();
      |                          ~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::TriangularView<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::TriangularView<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::TriangularView<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 5>, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> > >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_SupernodalMatrix.h:278:57:   required from 'void Eigen::internal::MappedSuperNodalMatrix<_Scalar, _StorageIndex>::solveInPlace(Eigen::MatrixBase<OtherDerived>&) const [with Dest = Eigen::Matrix<double, -1, 1>; _Scalar = double; _StorageIndex = int]'
  278 |         U = A.template triangularView<UnitLower>().solve(U);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU.h:809:24:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseLU/SparseLU_SupernodalMatrix.h:282:42:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:51:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Matrix<double, -1, 1>; U = Eigen::Matrix<double, -1, 1>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   required from 'typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType Eigen::MatrixBase<Derived>::dot(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Matrix<double, -1, 1>; Derived = Eigen::Matrix<double, -1, 1>; typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType = double; typename Eigen::internal::traits<T>::Scalar = double; typename Eigen::internal::traits<OtherDerived>::Scalar = double]'
   84 |   return internal::dot_nocheck<Derived,OtherDerived>::run(*this, other);
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:71:17:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80:   required from 'struct Eigen::internal::evaluator<Eigen::SparseCompressedBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > > >'
  336 |   typedef typename DenseCoeffsBase<Derived,ReadOnlyAccessors>::CoeffReturnType CoeffReturnType;
      |                                                                                ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:364:8:   required from 'struct Eigen::internal::evaluator<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >'
  364 | struct evaluator<Ref<const SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseUtil.h:121:8:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Sparse>'
  121 | struct plain_object_eval<T,Sparse>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseDenseProduct.h:187:104:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::SparseShape, Eigen::DenseShape, ProductType>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix<double, -1, 1>; Lhs = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; int ProductType = 7; Scalar = double]'
  187 |     typedef typename nested_eval<Lhs,((Rhs::Flags&RowMajorBit)==0) ? 1 : Rhs::ColsAtCompileTime>::type LhsNested;
      |                                                                                                        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Matrix<double, -1, 1>; Lhs = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Derived = Eigen::internal::generic_product_impl<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, Eigen::SparseShape, Eigen::DenseShape, 7>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:33:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h:91:26:   required from 'void Eigen::DiagonalPreconditioner<_Scalar>::_solve_impl(const Rhs&, Dest&) const [with Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; _Scalar = double]'
   91 |       x = m_invdiag.array() * b.array() ;
      |           ~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:147:26:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h:91:29:   required from 'void Eigen::DiagonalPreconditioner<_Scalar>::_solve_impl(const Rhs&, Dest&) const [with Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; _Scalar = double]'
   91 |       x = m_invdiag.array() * b.array() ;
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:147:26:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:0:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:333:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of 'class Eigen::internal::gemv_traits<double, double, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:87:38:   required from 'struct Eigen::internal::general_matrix_vector_product<long long int, double, Eigen::internal::const_blas_data_mapper<double, long long int, 0>, 0, false, double, Eigen::internal::const_blas_data_mapper<double, long long int, 1>, false, 0>'
   87 |   typedef typename Traits::LhsPacket LhsPacket;
      |                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:253:134:   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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; 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]'
  252 |       general_matrix_vector_product
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                   
  253 |           <Index,LhsScalar,LhsMapper,ColMajor,LhsBlasTraits::NeedToConjugate,RhsScalar,RhsMapper,RhsBlasTraits::NeedToConjugate>::run(
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  254 |           actualLhs.rows(), actualLhs.cols(),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                         
  255 |           LhsMapper(actualLhs.data(), actualLhs.outerStride()),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                       
  256 |           RhsMapper(actualRhs.data(), actualRhs.innerStride()),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                       
  257 |           dest.data(), 1,
      |           ~~~~~~~~~~~~~~~                                                                                                             
  258 |           compatibleAlpha);
      |           ~~~~~~~~~~~~~~~~                                                                                                            
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::DenseShape, 7>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Lhs = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Scalar = double]'
  385 |     internal::gemv_dense_selector<Side,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                             (int(MatrixType::Flags)&RowMajorBit) ? RowMajor : ColMajor,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |                             bool(internal::blas_traits<MatrixType>::HasUsableDirectAccess)
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  388 |                            >::run(actual_lhs, actual_rhs, dst, alpha);
      |                            ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Lhs = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::subTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Lhs = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>]'
  357 |   { scaleAndAddTo(dst, lhs, rhs, Scalar(-1)); }
      |     ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                                     ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                      ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                          ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                                                                  ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of 'class Eigen::internal::gemv_traits<double, double, 1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:91:42:   required from 'struct Eigen::internal::general_matrix_vector_product<long long int, double, Eigen::internal::const_blas_data_mapper<double, long long int, 0>, 0, false, double, Eigen::internal::const_blas_data_mapper<double, long long int, 1>, false, 0>'
   91 |   typedef typename HalfTraits::LhsPacket LhsPacketHalf;
      |                                          ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:253:134:   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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; 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]'
  252 |       general_matrix_vector_product
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                   
  253 |           <Index,LhsScalar,LhsMapper,ColMajor,LhsBlasTraits::NeedToConjugate,RhsScalar,RhsMapper,RhsBlasTraits::NeedToConjugate>::run(
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  254 |           actualLhs.rows(), actualLhs.cols(),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                         
  255 |           LhsMapper(actualLhs.data(), actualLhs.outerStride()),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                       
  256 |           RhsMapper(actualRhs.data(), actualRhs.innerStride()),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                       
  257 |           dest.data(), 1,
      |           ~~~~~~~~~~~~~~~                                                                                                             
  258 |           compatibleAlpha);
      |           ~~~~~~~~~~~~~~~~                                                                                                            
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::DenseShape, 7>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Lhs = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Scalar = double]'
  385 |     internal::gemv_dense_selector<Side,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                             (int(MatrixType::Flags)&RowMajorBit) ? RowMajor : ColMajor,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |                             bool(internal::blas_traits<MatrixType>::HasUsableDirectAccess)
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  388 |                            >::run(actual_lhs, actual_rhs, dst, alpha);
      |                            ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Lhs = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::subTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Lhs = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>]'
  357 |   { scaleAndAddTo(dst, lhs, rhs, Scalar(-1)); }
      |     ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                                     ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                      ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                          ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                                                                  ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of 'class Eigen::internal::gemv_traits<double, double, 2>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:95:45:   required from 'struct Eigen::internal::general_matrix_vector_product<long long int, double, Eigen::internal::const_blas_data_mapper<double, long long int, 0>, 0, false, double, Eigen::internal::const_blas_data_mapper<double, long long int, 1>, false, 0>'
   95 |   typedef typename QuarterTraits::LhsPacket LhsPacketQuarter;
      |                                             ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:253:134:   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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; 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]'
  252 |       general_matrix_vector_product
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                                   
  253 |           <Index,LhsScalar,LhsMapper,ColMajor,LhsBlasTraits::NeedToConjugate,RhsScalar,RhsMapper,RhsBlasTraits::NeedToConjugate>::run(
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  254 |           actualLhs.rows(), actualLhs.cols(),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                                         
  255 |           LhsMapper(actualLhs.data(), actualLhs.outerStride()),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                       
  256 |           RhsMapper(actualRhs.data(), actualRhs.innerStride()),
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                                                       
  257 |           dest.data(), 1,
      |           ~~~~~~~~~~~~~~~                                                                                                             
  258 |           compatibleAlpha);
      |           ~~~~~~~~~~~~~~~~                                                                                                            
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::DenseShape, 7>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Lhs = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Scalar = double]'
  385 |     internal::gemv_dense_selector<Side,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                             (int(MatrixType::Flags)&RowMajorBit) ? RowMajor : ColMajor,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |                             bool(internal::blas_traits<MatrixType>::HasUsableDirectAccess)
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  388 |                            >::run(actual_lhs, actual_rhs, dst, alpha);
      |                            ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Lhs = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:357:18:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::subTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Lhs = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Derived = Eigen::internal::generic_product_impl<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>]'
  357 |   { scaleAndAddTo(dst, lhs, rhs, Scalar(-1)); }
      |     ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
   42 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                                     ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 &&
      |                                      ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                          ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                                                                  ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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
      |                                                                     ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; 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());
      |                            ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:50:23:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 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
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 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();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/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, true>, Eigen::Dense>'
  372 |   typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type;
      |                                                                                                      ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:1003:59:   required from 'struct Eigen::internal::permutation_matrix_product<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 1, false, Eigen::DenseShape>'
 1003 |     typedef typename nested_eval<ExpressionType, 1>::type MatrixType;
      |                                                           ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:1063:72:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::PermutationShape, MatrixShape, ProductTag>::evalTo(Dest&, const Lhs&, const Rhs&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>; Lhs = Eigen::PermutationMatrix<-1, -1, int>; Rhs = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>; int ProductTag = 7; MatrixShape = Eigen::DenseShape]'
 1063 |     permutation_matrix_product<Rhs, OnTheLeft, false, MatrixShape>::run(dst, lhs, rhs);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:148:43:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::Product<Lhs, Rhs, Options>, Eigen::internal::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::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>; Lhs = Eigen::PermutationMatrix<-1, -1, int>; Rhs = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>; int Options = 2; Scalar = double; SrcXprType = Eigen::Product<Eigen::PermutationMatrix<-1, -1, int>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 2>]'
  148 |     generic_product_impl<Lhs, Rhs>::evalTo(dst, src.lhs(), src.rhs());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Product<Eigen::PermutationMatrix<-1, -1, int>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 2>; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:858:27:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:330:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of 'class Eigen::internal::gebp_traits<double, double, false, false, 1, 0>':
D:/RCompile/CRANpkg/lib/4.7/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 long int; int Mode = 5; bool Conjugate = false; int TriStorageOrder = 0; int OtherInnerStride = 1]'
   64 |       SmallPanelWidth   = EIGEN_PLAIN_ENUM_MAX(Traits::mr,Traits::nr),
      |                                                        ^~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, 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);
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; _MatrixType = Eigen::Map<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);
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; _MatrixType = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]'
  522 |     { return solveInPlace<OnTheLeft>(other); }
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:552:25:   required from 'void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::_solve_impl(const RhsType&, DstType&) const [with RhsType = Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; DstType = Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; _MatrixType = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]'
  552 |       this->solveInPlace(dst);
      |       ~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:147:26:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                                              ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of 'class Eigen::internal::gebp_traits<double, double, false, false, 1, 1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1080:42:   required from 'struct Eigen::internal::gebp_kernel<double, double, long long int, Eigen::internal::blas_data_mapper<double, long long int, 0, 0, 1>, 4, 4, false, false>'
 1080 |   typedef typename HalfTraits::LhsPacket LhsPacketHalf;
      |                                          ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 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;
      |                                                                                               ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, 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);
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; _MatrixType = Eigen::Map<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);
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; _MatrixType = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]'
  522 |     { return solveInPlace<OnTheLeft>(other); }
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:552:25:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                                              ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of 'class Eigen::internal::gebp_traits<double, double, false, false, 1, 2>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1085:45:   required from 'struct Eigen::internal::gebp_kernel<double, double, long long int, Eigen::internal::blas_data_mapper<double, long long int, 0, 0, 1>, 4, 4, false, false>'
 1085 |   typedef typename QuarterTraits::LhsPacket LhsPacketQuarter;
      |                                             ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 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;
      |                                                                                               ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, 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);
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; _MatrixType = Eigen::Map<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);
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; _MatrixType = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]'
  522 |     { return solveInPlace<OnTheLeft>(other); }
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:552:25:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                           ^
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro 'PACKET_DECL_COND_PREFIX'
  384 |   prefix ## name ## Packet
      |   ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                                              ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                                 ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                         ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 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);
      |                                                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:73:12:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/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>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 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> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 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>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 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());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 1>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false>, 1>'
  223 | template<typename Derived> class MapBase<Derived, WriteAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/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, true>, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, true>, 1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true>, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true>, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true>, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true>, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 long int; DataMapper = Eigen::internal::blas_data_mapper<double, long long int, 0, 0, 1>; int nr = 4; bool Conjugate = false; bool PanelMode = true]':
D:/RCompile/CRANpkg/lib/4.7/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 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);
      |           ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, 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);
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; _MatrixType = Eigen::Map<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);
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; _MatrixType = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]'
  522 |     { return solveInPlace<OnTheLeft>(other); }
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:552:25:   required from 'void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::_solve_impl(const RhsType&, DstType&) const [with RhsType = Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; DstType = Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; _MatrixType = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]'
  552 |       this->solveInPlace(dst);
      |       ~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:147:26:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                              ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 long int; DataMapper = Eigen::internal::const_blas_data_mapper<double, long long int, 0>; int Pack1 = 4; int Pack2 = 2; Packet = __vector(2) double; bool Conjugate = false; bool PanelMode = false]':
D:/RCompile/CRANpkg/lib/4.7/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 long int; int Mode = 5; bool Conjugate = false; int TriStorageOrder = 0; int OtherInnerStride = 1]'
  162 |             pack_lhs(blockA, tri.getSubMapper(startTarget,startBlock), actualPanelWidth, lengthTarget);
      |             ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, 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);
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; _MatrixType = Eigen::Map<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);
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; _MatrixType = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]'
  522 |     { return solveInPlace<OnTheLeft>(other); }
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:552:25:   required from 'void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::_solve_impl(const RhsType&, DstType&) const [with RhsType = Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; DstType = Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; _MatrixType = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]'
  552 |       this->solveInPlace(dst);
      |       ~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:147:26:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                  ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                              ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 long int; DataMapper = Eigen::internal::blas_data_mapper<double, long long int, 0, 0, 1>; int mr = 4; int nr = 4; bool ConjugateLhs = false; bool ConjugateRhs = false; ResScalar = double]':
D:/RCompile/CRANpkg/lib/4.7/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 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);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, 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);
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; _MatrixType = Eigen::Map<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);
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; _MatrixType = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]'
  522 |     { return solveInPlace<OnTheLeft>(other); }
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:552:25:   required from 'void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::_solve_impl(const RhsType&, DstType&) const [with RhsType = Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; DstType = Eigen::Map<Eigen::Matrix<double, -1, -1>, 16, Eigen::OuterStride<> >; _MatrixType = Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]'
  552 |       this->solveInPlace(dst);
      |       ~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:147:26:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                       ^~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                          ^~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                                                                       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >'
  179 |     typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
      |                                                                                 ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   required from 'class Eigen::BlockImpl<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false, Eigen::Dense>'
  154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:103:81:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:124:102:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:125:46:   required from 'static void Eigen::internal::triangular_solver_unroller<Lhs, Rhs, Mode, LoopIndex, Size, false>::run(const Lhs&, Rhs&) [with Lhs = Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >; int Mode = 5; int LoopIndex = 0; int Size = 2]'
  124 |       rhs.coeffRef(DiagIndex) -= lhs.row(DiagIndex).template segment<LoopIndex>(StartIndex).transpose()
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  125 |                                 .cwiseProduct(rhs.template segment<LoopIndex>(StartIndex)).sum();
      |                                 ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:142:75:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:124:102:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:125:46:   required from 'static void Eigen::internal::triangular_solver_unroller<Lhs, Rhs, Mode, LoopIndex, Size, false>::run(const Lhs&, Rhs&) [with Lhs = Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >; int Mode = 5; int LoopIndex = 0; int Size = 3]'
  124 |       rhs.coeffRef(DiagIndex) -= lhs.row(DiagIndex).template segment<LoopIndex>(StartIndex).transpose()
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  125 |                                 .cwiseProduct(rhs.template segment<LoopIndex>(StartIndex)).sum();
      |                                 ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:142:75:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, -1, 1, true>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, -1, 1, true>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, -1, 1, true> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, -1, 1, true> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, -1, 1, true>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, -1, 1, true, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:124:102:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:125:46:   required from 'static void Eigen::internal::triangular_solver_unroller<Lhs, Rhs, Mode, LoopIndex, Size, false>::run(const Lhs&, Rhs&) [with Lhs = Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >; int Mode = 5; int LoopIndex = 1; int Size = 2]'
  124 |       rhs.coeffRef(DiagIndex) -= lhs.row(DiagIndex).template segment<LoopIndex>(StartIndex).transpose()
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  125 |                                 .cwiseProduct(rhs.template segment<LoopIndex>(StartIndex)).sum();
      |                                 ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:130:67:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:124:102:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:125:46:   required from 'static void Eigen::internal::triangular_solver_unroller<Lhs, Rhs, Mode, LoopIndex, Size, false>::run(const Lhs&, Rhs&) [with Lhs = Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >; int Mode = 5; int LoopIndex = 1; int Size = 3]'
  124 |       rhs.coeffRef(DiagIndex) -= lhs.row(DiagIndex).template segment<LoopIndex>(StartIndex).transpose()
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  125 |                                 .cwiseProduct(rhs.template segment<LoopIndex>(StartIndex)).sum();
      |                                 ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:130:67:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1043:41:   required from 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >'
 1043 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class 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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1043:41:   required from 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >'
 1043 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class 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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 0, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 0, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false>, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:329:7:   required from 'class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false, true>'
  329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Block.h:154:7:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:169:0:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::factor(const Matrix&, NT&) [with EigenSolverT = Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> >; Matrix = CGAL::Eigen_sparse_matrix<double>; NT = double]'
  169 |     solver().compute(*m_mat);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:124:102:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:169:0:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::factor(const Matrix&, NT&) [with EigenSolverT = Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> >; Matrix = CGAL::Eigen_sparse_matrix<double>; NT = double]'
  169 |     solver().compute(*m_mat);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 2, 1, false>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 2, 1, false>, 1>'
  302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 2, 1, false>, 3>'
  555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 2, 1, false> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 2, 1, false> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34:   required from 'class Eigen::MapBase<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 2, 1, false>, 0>'
   37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:169:0:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::factor(const Matrix&, NT&) [with EigenSolverT = Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> >; Matrix = CGAL::Eigen_sparse_matrix<double>; NT = double]'
  169 |     solver().compute(*m_mat);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 2, 1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 2, 1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 2, 1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 2, 1, false>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 2, 1, false> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:125:46:   required from 'static void Eigen::internal::triangular_solver_unroller<Lhs, Rhs, Mode, LoopIndex, Size, false>::run(const Lhs&, Rhs&) [with Lhs = Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >; int Mode = 5; int LoopIndex = 2; int Size = 3]'
  124 |       rhs.coeffRef(DiagIndex) -= lhs.row(DiagIndex).template segment<LoopIndex>(StartIndex).transpose()
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  125 |                                 .cwiseProduct(rhs.template segment<LoopIndex>(StartIndex)).sum();
      |                                 ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:130:67:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:169:0:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::factor(const Matrix&, NT&) [with EigenSolverT = Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> >; Matrix = CGAL::Eigen_sparse_matrix<double>; NT = double]'
  169 |     solver().compute(*m_mat);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37:   required from 'class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, Eigen::Dense>'
  118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
      |                                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37:   required from 'class Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >'
   52 | template<typename MatrixType> class Transpose
      |                                     ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:50:23:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, -1, 1, true> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, -1, 1, true> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, -1, 1, true> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, -1, 1, true>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, -1, 1, true> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>; U = Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, -1, 1, true>; ResScalar = double]'
   50 |     return a.transpose().template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class 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<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 2, 2>, 0, Eigen::OuterStride<> >, 1, 2, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 2, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class 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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 1, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 2, 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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:169:0:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::factor(const Matrix&, NT&) [with EigenSolverT = Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> >; Matrix = CGAL::Eigen_sparse_matrix<double>; NT = double]'
  169 |     solver().compute(*m_mat);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 2, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 2, 1, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 2, 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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 2, 1, false> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:357:7:   required from 'class 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<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 2, 1, false> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, 3, 3>, 0, Eigen::OuterStride<> >, 1, 3, false>, 1, 2, false> >, const Eigen::Block<Eigen::Map<Eigen::Matrix<double, 3, 1>, 0, Eigen::Stride<0, 0> >, 2, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:169:0:   required from 'bool CGAL::Eigen_solver_traits<EigenSolverT>::factor(const Matrix&, NT&) [with EigenSolverT = Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> >; Matrix = CGAL::Eigen_sparse_matrix<double>; NT = double]'
  169 |     solver().compute(*m_mat);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/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>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:774:20:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/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>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:162:38:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  162 |     bool prefactor_ok = solver.factor(A, D);
      |                         ~~~~~~~~~~~~~^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false>; SrcXprType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false>; Functor = swap_assign_op<double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false>; SrcXprType = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false>; Functor = Eigen::internal::swap_assign_op<double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false>; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false>; Func = swap_assign_op<double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false>; Src = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false>; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false>]'
  424 |       call_assignment(derived(), other.const_cast_derived(), internal::swap_assign_op<Scalar>());
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:1033:18:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, false> >':
D:/RCompile/CRANpkg/lib/4.7/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, false> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41:   required from 'struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, Eigen::internal::IndexBased, double>'
  311 |     CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8:   required from 'struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> > >'
   90 | struct evaluator : public unary_evaluator<T>
      |        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> > >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Map<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),
      |                                         ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of 'struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, -1, 1, true> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8:   required from 'struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, -1, 1, true> >'
  100 | struct evaluator<const T>
      |        ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Map<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),
      |                                                                              ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, -1, 1, true> > >'
  722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, -1, 1, true> > >'
  357 | class redux_evaluator : public internal::evaluator<_XprType>
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::OuterStride<> >, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]'
  414 |   ThisEvaluator thisEval(derived());
      |                 ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Redux.h:463:25:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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, true>, 1, 1, false> >':
D:/RCompile/CRANpkg/lib/4.7/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::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false>; SrcXprType = Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false>; Functor = assign_op<double, double>]'
  774 |   SrcEvaluatorType srcEvaluator(src);
      |                    ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false>; SrcXprType = Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false>; Functor = Eigen::internal::assign_op<double, double>; Weak = void]'
  954 |     call_dense_assignment_loop(dst, src, func);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false>; Src = Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false>; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false>; Src = Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 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);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18:   required from 'void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false>; Src = Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 1, 1, false>]'
  836 |   call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
      |   ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Assign.h:66:28:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h:172:46:   required from 'bool CGAL::Polygon_mesh_processing::internal::Fair_Polyhedron_3<PolygonMesh, SparseLinearSolver, WeightCalculator, VertexPointMap>::fair(const VertexRange&, SparseLinearSolver, unsigned int) [with VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
  172 |     bool is_all_solved = solver.linear_solver(Bx, X) && solver.linear_solver(By, Y) && solver.linear_solver(Bz, Z);
      |                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:54:0:   required from 'bool CGAL::Polygon_mesh_processing::internal::fair(TriangleMesh&, const VertexRange&, SparseLinearSolver, WeightCalculator, unsigned int, VertexPointMap) [with SparseLinearSolver = CGAL::Eigen_solver_traits<Eigen::SparseLU<Eigen::SparseMatrix<double, 0, int>, Eigen::COLAMDOrdering<int> > >; WeightCalculator = CGAL::Weights::Secure_cotangent_weight_with_voronoi_area<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >, CGAL::Epick>; TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >]'
   54 |   return fair_functor.fair(vertices, solver, continuity);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:175:0:   required from 'bool CGAL::Polygon_mesh_processing::fair(TriangleMesh&, const VertexRange&, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexRange = std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> >; NamedParameters = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >, CGAL::internal_np::vertex_output_iterator_t, CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property> >]'
  175 |     return internal::fair(tmesh, vertices,
  176 |       choose_parameter<Default_solver>(get_parameter(np, internal_np::sparse_linear_solver)),
  177 |       choose_parameter(get_parameter(np, internal_np::weight_calculator), Default_weight_calculator(tmesh, vpmap, gt)),
  178 |       choose_parameter(get_parameter(np, internal_np::fairing_continuity), 1),
  179 |       vpmap);
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:599:0:   required from 'auto CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole(PolygonMesh&, typename boost::graph_traits<Graph>::halfedge_descriptor, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NP_T = std::back_insert_iterator<std::vector<CGAL::SM_Vertex_index, std::allocator<CGAL::SM_Vertex_index> > >; NP_Tag = CGAL::internal_np::vertex_output_iterator_t; NP_Base = CGAL::Named_function_parameters<std::back_insert_iterator<std::vector<CGAL::SM_Face_index, std::allocator<CGAL::SM_Face_index> > >, CGAL::internal_np::face_output_iterator_t, CGAL::internal_np::No_property>; typename boost::graph_traits<Graph>::halfedge_descriptor = CGAL::SM_Halfedge_index]'
  599 |     bool fair_success = fair(pmesh, patch, np);
export_repair.cpp:69:0:   required from 'MeshT fill_boundary_holes(MeshT&, bool, double, int, unsigned int, bool) [with MeshT = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; PointT = CGAL::Point_3<CGAL::Epick>]'
   69 |     bool success = std::get<0>(PMP::triangulate_refine_and_fair_hole(
   70 |         mesh, h,
   71 |         CGAL::parameters::face_output_iterator(std::back_inserter(patch_facets))
   72 |                        .vertex_output_iterator(std::back_inserter(patch_vertices))));
export_repair.cpp:122:0:   required from here
  122 | template Mesh3  fill_boundary_holes<Mesh3,  Point3>(Mesh3&,   const bool, const double, const int, const unsigned int, const bool);
D:/RCompile/CRANpkg/lib/4.7/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,
      |                                                      ^~~~~~~~~
g++  -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.7/BH/include' -I'D:/RCompile/CRANpkg/lib/4.7/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"   -DCGAL_HEADER_ONLY=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c export_subdivide.cpp -o export_subdivide.o
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:205,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dimension.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Bbox_2.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic_classes.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
                 from SurfaceMesh.h:17,
                 from export_subdivide.cpp:14:
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                       ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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) {
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:174:
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/bind.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian_converter.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Filtered_kernel.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:21:
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/property_map.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
                 from SurfaceMesh.h:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/std_thread.h:43,
                 from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/thread:45,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/config.h:428,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20:
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
g++  -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.7/BH/include' -I'D:/RCompile/CRANpkg/lib/4.7/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"   -DCGAL_HEADER_ONLY=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c internal_cpptor.cpp -o internal_cpptor.o
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:205,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dimension.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Bbox_2.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic_classes.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
                 from SurfaceMesh.h:17,
                 from internal_cpptor.cpp:14:
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                       ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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) {
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:174:
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/bind.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian_converter.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Filtered_kernel.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:21:
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/property_map.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
                 from SurfaceMesh.h:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/std_thread.h:43,
                 from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/thread:45,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/config.h:428,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20:
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/scoped_ptr.hpp:13,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/adjacency_list.hpp:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:28,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/selection.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/repair_degeneracies.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/refine_impl.h:28,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/refine.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_faces.h:18,
                 from internal_cpptor.cpp:18:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/scoped_ptr.hpp:63:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   63 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:165:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<float, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<float> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46:   required from here
   24 |     ResAlignment = traits<Quaternion<float> >::Alignment
      |                                              ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:271:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<float, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<float, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<float> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<float>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3:   required from here
   27 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<double> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47:   required from here
   98 |     ResAlignment = traits<Quaternion<double> >::Alignment
      |                                               ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<double> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<double>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3:   required from here
  102 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/SparseCore:37,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Sparse:26,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:26,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:23:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::SparseMatrix<double, 0, int> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7:   required from 'class Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 0, int> >'
   36 | class SparseCompressedBase
      |       ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7:   required from 'class Eigen::SparseMatrix<double, 0, int>'
   96 | class SparseMatrix
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:293:21:   required from 'struct CGAL::Eigen_sparse_matrix<double>'
  293 |   mutable EigenType m_matrix;
      |                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:99:74:   required from here
   99 | template<class EigenSolverT = Eigen::BiCGSTAB<Eigen_sparse_matrix<double>::EigenType> >
      |                                                                          ^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7:   required from 'class Eigen::SparseCompressedBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >'
   36 | class SparseCompressedBase
      |       ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMap.h:50:7:   required from 'class Eigen::SparseMapBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 0>'
   50 | class SparseMapBase<Derived,ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:83:34:   required from 'class Eigen::internal::SparseRefBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >'
   83 | template<typename Derived> class SparseRefBase
      |                                  ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:177:7:   required from 'class Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >'
  177 | class Ref<const SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:37:41:   required from 'struct Eigen::internal::is_ref_compatible_impl<Eigen::SparseMatrix<double, 0, int> >'
   37 |   enum { value = sizeof(test<MatrixType>(ms_from, 0))==sizeof(yes) };
      |                        ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:43:81:   required from 'struct Eigen::internal::is_ref_compatible<Eigen::SparseMatrix<double, 0, int> >'
   43 |   enum { value = is_ref_compatible_impl<typename remove_all<MatrixType>::type>::value };
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:46:49:   required from 'class Eigen::IterativeSolverBase<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> > >'
   46 | template<typename MatrixType, bool MatrixFree = !internal::is_ref_compatible<MatrixType>::value>
      |                                                 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:158:7:   required from 'class Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >'
  158 | class BiCGSTAB : public IterativeSolverBase<BiCGSTAB<_MatrixType,_Preconditioner> >
      |       ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:239:23:   required from here
  239 |   typedef EigenSolverT::Scalar                                          Scalar;
      |                       ^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, -1>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, -1, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h:41:43:   required from 'class Eigen::DiagonalPreconditioner<double>'
   41 |     typedef typename Vector::StorageIndex StorageIndex;
      |                                           ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:431:18:   required from 'class Eigen::IterativeSolverBase<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> > >'
  431 |   Preconditioner m_preconditioner;
      |                  ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:158:7:   required from 'class Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >'
  158 | class BiCGSTAB : public IterativeSolverBase<BiCGSTAB<_MatrixType,_Preconditioner> >
      |       ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:239:23:   required from here
  239 |   typedef EigenSolverT::Scalar                                          Scalar;
      |                       ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, -1, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h:41:43:   required from 'class Eigen::DiagonalPreconditioner<double>'
   41 |     typedef typename Vector::StorageIndex StorageIndex;
      |                                           ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:431:18:   required from 'class Eigen::IterativeSolverBase<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> > >'
  431 |   Preconditioner m_preconditioner;
      |                  ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:158:7:   required from 'class Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >'
  158 | class BiCGSTAB : public IterativeSolverBase<BiCGSTAB<_MatrixType,_Preconditioner> >
      |       ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:239:23:   required from here
  239 |   typedef EigenSolverT::Scalar                                          Scalar;
      |                       ^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:41:7:   required from 'class Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >'
   41 | class SolveWithGuess : public internal::generic_xpr_base<SolveWithGuess<Decomposition,RhsType,GuessType>, MatrixXpr, typename internal::traits<RhsType>::StorageKind>::type
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:38:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/assert.hpp:35,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:31,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:20:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/int.hpp:20,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda_fwd.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_spec.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/or.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/type_traits.h:16,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Algebraic_structure_traits.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/number_type_basic.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:28:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function 'boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~VertexListGraphConcept()'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro 'BOOST_concept'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from 'struct boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function 'boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~EdgeListGraphConcept()'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro 'BOOST_concept'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function 'boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~IncidenceGraphConcept()'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro 'BOOST_concept'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:960:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::typed_identity_property_map<long long unsigned int>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Matrix<double, -1, 1>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:717:21:   required from 'Derived& Eigen::PlainObjectBase<Derived>::setOnes(Eigen::Index) [with Derived = Eigen::Matrix<double, -1, 1>; Eigen::Index = long long int]'
  717 |   return setConstant(Scalar(1));
      |          ~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:276:14:   required from here
  276 |     X.setOnes(B.rows());
      |     ~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  182 |     BOOST_CONCEPT_USAGE(VertexListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from 'struct boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:148:7:   required from 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:208:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:148:7:   required from 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::typed_identity_property_map<long long unsigned int>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function 'boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~VertexListGraphConcept()'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro 'BOOST_concept'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from 'struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function 'boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~EdgeListGraphConcept()'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro 'BOOST_concept'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function 'boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~IncidenceGraphConcept()'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro 'BOOST_concept'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, void*>, const boost::detail::edge_desc_impl<boost::directed_tag, void*>&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_reverse_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:960:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, void*>, const boost::detail::edge_desc_impl<boost::directed_tag, void*>&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_reverse_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, boost::vertex_index_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, boost::vertex_index_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:180:7:   required from 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function 'boost::RandomAccessIteratorConcept<std::_Bit_iterator>::~RandomAccessIteratorConcept()'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro 'BOOST_concept'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function 'boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >::~RandomAccessIteratorConcept()'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro 'BOOST_concept'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::SparseMatrix<double, 1, int> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7:   required from 'class Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 1, int> >'
   36 | class SparseCompressedBase
      |       ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7:   required from 'class Eigen::SparseMatrix<double, 1, int>'
   96 | class SparseMatrix
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1040:66:   required from 'void Eigen::internal::set_from_triplets(const InputIterator&, const InputIterator&, SparseMatrixType&, DupFunctor) [with InputIterator = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; SparseMatrixType = Eigen::SparseMatrix<double, 0, int>; DupFunctor = scalar_sum_op<double, double>]'
 1040 |   SparseMatrix<Scalar,IsRowMajor?ColMajor:RowMajor,StorageIndex> trMat(mat.rows(),mat.cols());
      |                                                                  ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1110:92:   required from 'void Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::setFromTriplets(const InputIterators&, const InputIterators&) [with InputIterators = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1110 |   internal::set_from_triplets<InputIterators, SparseMatrix<Scalar,_Options,_StorageIndex> >(begin, end, *this, internal::scalar_sum_op<Scalar,Scalar>());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:239:29:   required from 'void CGAL::Eigen_sparse_matrix<T>::assemble_matrix() const [with T = double]'
  239 |     m_matrix.setFromTriplets(m_triplets.begin(), m_triplets.end());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:249:7:   required from 'const CGAL::Eigen_sparse_matrix<T>::EigenType& CGAL::Eigen_sparse_matrix<T>::eigen_object() const [with T = double; EigenType = Eigen::SparseMatrix<double, 0, int>]'
  249 |       assemble_matrix();
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:271:42:   required from here
  271 |     m_solver_sptr->compute(A.eigen_object());
      |                            ~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  182 |     BOOST_CONCEPT_USAGE(VertexListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from 'struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Comparable<TT>::~Comparable() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::SparseMatrix<double, 1, int>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80:   required from 'struct Eigen::internal::evaluator<Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 1, int> > >'
  336 |   typedef typename DenseCoeffsBase<Derived,ReadOnlyAccessors>::CoeffReturnType CoeffReturnType;
      |                                                                                ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8:   required from 'struct Eigen::internal::evaluator<Eigen::SparseMatrix<double, 1, int> >'
 1505 | struct evaluator<SparseMatrix<_Scalar,_Options,_StorageIndex> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1181:93:   required from 'Eigen::SparseMatrix<_Scalar, _Options, _StorageIndex>& Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::operator=(const Eigen::SparseMatrixBase<OtherDerived>&) [with OtherDerived = Eigen::SparseMatrix<double, 1, int>; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1181 |   const bool needToTranspose = (Flags & RowMajorBit) != (internal::evaluator<OtherDerived>::Flags & RowMajorBit);
      |                                                                                             ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1063:7:   required from 'void Eigen::internal::set_from_triplets(const InputIterator&, const InputIterator&, SparseMatrixType&, DupFunctor) [with InputIterator = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; SparseMatrixType = Eigen::SparseMatrix<double, 0, int>; DupFunctor = scalar_sum_op<double, double>]'
 1063 |   mat = trMat;
      |   ~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1110:92:   required from 'void Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::setFromTriplets(const InputIterators&, const InputIterators&) [with InputIterators = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1110 |   internal::set_from_triplets<InputIterators, SparseMatrix<Scalar,_Options,_StorageIndex> >(begin, end, *this, internal::scalar_sum_op<Scalar,Scalar>());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:239:29:   required from 'void CGAL::Eigen_sparse_matrix<T>::assemble_matrix() const [with T = double]'
  239 |     m_matrix.setFromTriplets(m_triplets.begin(), m_triplets.end());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:249:7:   required from 'const CGAL::Eigen_sparse_matrix<T>::EigenType& CGAL::Eigen_sparse_matrix<T>::eigen_object() const [with T = double; EigenType = Eigen::SparseMatrix<double, 0, int>]'
  249 |       assemble_matrix();
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:271:42:   required from here
  271 |     m_solver_sptr->compute(A.eigen_object());
      |                            ~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:603:11:   required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:603:11:   required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<void*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<void*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<void*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long long int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:514:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:109:22: note: in a call to non-static member function 'boost::SignedInteger<long long int>::~SignedInteger()'
  109 |   template <> struct SignedInteger< ::boost::long_long_type> {};
      |                      ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:545:11:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:545:11:   required from 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:573:11:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:573:11:   required from 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:603:11:   required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<std::_List_iterator<void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::SparseMatrix<double, 0, int>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80:   required from 'struct Eigen::internal::evaluator<Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 0, int> > >'
  336 |   typedef typename DenseCoeffsBase<Derived,ReadOnlyAccessors>::CoeffReturnType CoeffReturnType;
      |                                                                                ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8:   required from 'struct Eigen::internal::evaluator<Eigen::SparseMatrix<double, 0, int> >'
 1505 | struct evaluator<SparseMatrix<_Scalar,_Options,_StorageIndex> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:79:45:   required from 'void Eigen::internal::assign_sparse_to_sparse(DstXprType&, const SrcXprType&) [with DstXprType = Eigen::SparseMatrix<double, 0, int>; SrcXprType = Eigen::SparseMatrix<double, 1, int>]'
   79 |   const bool transpose = (DstEvaluatorType::Flags & RowMajorBit) != (SrcEvaluatorType::Flags & RowMajorBit);
      |                                             ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:132:28:   required from 'static void Eigen::internal::Assignment<DstXprType, SrcXprType, Functor, Eigen::internal::Sparse2Sparse>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<typename DstXprType::Scalar, typename SrcXprType::Scalar>&) [with DstXprType = Eigen::SparseMatrix<double, 0, int>; SrcXprType = Eigen::SparseMatrix<double, 1, int>; Functor = Eigen::internal::assign_op<double, double>; typename DstXprType::Scalar = double; typename SrcXprType::Scalar = double]'
  132 |     assign_sparse_to_sparse(dst.derived(), src.derived());
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:38:16:   required from 'Derived& Eigen::SparseMatrixBase<Derived>::operator=(const Eigen::SparseMatrixBase<OtherDerived>&) [with OtherDerived = Eigen::SparseMatrix<double, 1, int>; Derived = Eigen::SparseMatrix<double, 0, int>]'
   37 |   internal::Assignment<Derived,OtherDerived,internal::assign_op<Scalar,typename OtherDerived::Scalar> >
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   38 |           ::run(derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |           ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1239:27:   required from 'Eigen::SparseMatrix<_Scalar, _Options, _StorageIndex>& Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::operator=(const Eigen::SparseMatrixBase<OtherDerived>&) [with OtherDerived = Eigen::SparseMatrix<double, 1, int>; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1239 |     return Base::operator=(other.derived());
      |            ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1063:7:   required from 'void Eigen::internal::set_from_triplets(const InputIterator&, const InputIterator&, SparseMatrixType&, DupFunctor) [with InputIterator = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; SparseMatrixType = Eigen::SparseMatrix<double, 0, int>; DupFunctor = scalar_sum_op<double, double>]'
 1063 |   mat = trMat;
      |   ~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1110:92:   required from 'void Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::setFromTriplets(const InputIterators&, const InputIterators&) [with InputIterators = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1110 |   internal::set_from_triplets<InputIterators, SparseMatrix<Scalar,_Options,_StorageIndex> >(begin, end, *this, internal::scalar_sum_op<Scalar,Scalar>());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:239:29:   required from 'void CGAL::Eigen_sparse_matrix<T>::assemble_matrix() const [with T = double]'
  239 |     m_matrix.setFromTriplets(m_triplets.begin(), m_triplets.end());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:249:7:   required from 'const CGAL::Eigen_sparse_matrix<T>::EigenType& CGAL::Eigen_sparse_matrix<T>::eigen_object() const [with T = double; EigenType = Eigen::SparseMatrix<double, 0, int>]'
  249 |       assemble_matrix();
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:271:42:   required from here
  271 |     m_solver_sptr->compute(A.eigen_object());
      |                            ~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:42:29:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:42:23:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   42 |   VectorType r  = rhs - mat * x;
      |                   ~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:27:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
      |                         ~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:23:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
      |                    ~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:18:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
      |             ~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:11:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
      |         ~~^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:85:22:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   85 |     y = precond.solve(p);
      |         ~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:100:20:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
  100 |     x += alpha * y + w * z;
      |          ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Matrix<double, -1, 1>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:45:40:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_List_iterator<void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:44:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Matrix<double, -1, 1>; U = Eigen::Matrix<double, -1, 1>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:46:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Matrix<double, -1, 1>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:45:40:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   45 |   RealScalar r0_sqnorm = r0.squaredNorm();
      |                          ~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:51:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Matrix<double, -1, 1>; U = Eigen::Matrix<double, -1, 1>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   required from 'typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType Eigen::MatrixBase<Derived>::dot(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Matrix<double, -1, 1>; Derived = Eigen::Matrix<double, -1, 1>; typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType = double; typename Eigen::internal::traits<T>::Scalar = double; typename Eigen::internal::traits<OtherDerived>::Scalar = double]'
   84 |   return internal::dot_nocheck<Derived,OtherDerived>::run(*this, other);
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:71:17:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80:   required from 'struct Eigen::internal::evaluator<Eigen::SparseCompressedBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > > >'
  336 |   typedef typename DenseCoeffsBase<Derived,ReadOnlyAccessors>::CoeffReturnType CoeffReturnType;
      |                                                                                ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:364:8:   required from 'struct Eigen::internal::evaluator<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >'
  364 | struct evaluator<Ref<const SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseUtil.h:121:8:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Sparse>'
  121 | struct plain_object_eval<T,Sparse>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseDenseProduct.h:187:104:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::SparseShape, Eigen::DenseShape, ProductType>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix<double, -1, 1>; Lhs = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; int ProductType = 7; Scalar = double]'
  187 |     typedef typename nested_eval<Lhs,((Rhs::Flags&RowMajorBit)==0) ? 1 : Rhs::ColsAtCompileTime>::type LhsNested;
      |                                                                                                        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Matrix<double, -1, 1>; Lhs = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Derived = Eigen::internal::generic_product_impl<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, Eigen::SparseShape, Eigen::DenseShape, 7>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:33:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h:91:26:   required from 'void Eigen::DiagonalPreconditioner<_Scalar>::_solve_impl(const Rhs&, Dest&) const [with Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; _Scalar = double]'
   91 |       x = m_invdiag.array() * b.array() ;
      |           ~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:147:26:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h:91:29:   required from 'void Eigen::DiagonalPreconditioner<_Scalar>::_solve_impl(const Rhs&, Dest&) const [with Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; _Scalar = double]'
   91 |       x = m_invdiag.array() * b.array() ;
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:147:26:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
g++  -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.7/BH/include' -I'D:/RCompile/CRANpkg/lib/4.7/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"   -DCGAL_HEADER_ONLY=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c internal_rtocpp.cpp -o internal_rtocpp.o
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:205,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dimension.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Bbox_2.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic_classes.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
                 from SurfaceMesh.h:17,
                 from internal_rtocpp.cpp:14:
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                       ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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) {
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:174:
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/bind.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian_converter.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Filtered_kernel.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:21:
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/property_map.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
                 from SurfaceMesh.h:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/std_thread.h:43,
                 from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/thread:45,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/config.h:428,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20:
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/scoped_ptr.hpp:13,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/adjacency_list.hpp:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:28,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/selection.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/repair_degeneracies.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/refine_impl.h:28,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/refine.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_faces.h:18,
                 from internal_rtocpp.cpp:20:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/scoped_ptr.hpp:63:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   63 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:165:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<float, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<float> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46:   required from here
   24 |     ResAlignment = traits<Quaternion<float> >::Alignment
      |                                              ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:271:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<float, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<float, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<float> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<float>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3:   required from here
   27 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, 4>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49:   required from 'struct Eigen::internal::traits<Eigen::Quaternion<double> >'
  266 |     Alignment = internal::traits<Coefficients>::Alignment,
      |                                                 ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47:   required from here
   98 |     ResAlignment = traits<Quaternion<double> >::Alignment
      |                                               ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, 4, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50:   required from 'class Eigen::QuaternionBase<Eigen::Quaternion<double> >'
   46 |   typedef typename Coefficients::CoeffReturnType CoeffReturnType;
      |                                                  ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7:   required from 'class Eigen::Quaternion<double>'
  273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
      |       ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3:   required from here
  102 |   {
      |   ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/SparseCore:37,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Sparse:26,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/fair.h:26,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:23:
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::SparseMatrix<double, 0, int> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7:   required from 'class Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 0, int> >'
   36 | class SparseCompressedBase
      |       ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7:   required from 'class Eigen::SparseMatrix<double, 0, int>'
   96 | class SparseMatrix
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:293:21:   required from 'struct CGAL::Eigen_sparse_matrix<double>'
  293 |   mutable EigenType m_matrix;
      |                     ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:99:74:   required from here
   99 | template<class EigenSolverT = Eigen::BiCGSTAB<Eigen_sparse_matrix<double>::EigenType> >
      |                                                                          ^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7:   required from 'class Eigen::SparseCompressedBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >'
   36 | class SparseCompressedBase
      |       ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMap.h:50:7:   required from 'class Eigen::SparseMapBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 0>'
   50 | class SparseMapBase<Derived,ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:83:34:   required from 'class Eigen::internal::SparseRefBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >'
   83 | template<typename Derived> class SparseRefBase
      |                                  ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:177:7:   required from 'class Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >'
  177 | class Ref<const SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:37:41:   required from 'struct Eigen::internal::is_ref_compatible_impl<Eigen::SparseMatrix<double, 0, int> >'
   37 |   enum { value = sizeof(test<MatrixType>(ms_from, 0))==sizeof(yes) };
      |                        ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:43:81:   required from 'struct Eigen::internal::is_ref_compatible<Eigen::SparseMatrix<double, 0, int> >'
   43 |   enum { value = is_ref_compatible_impl<typename remove_all<MatrixType>::type>::value };
      |                                                                                 ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:46:49:   required from 'class Eigen::IterativeSolverBase<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> > >'
   46 | template<typename MatrixType, bool MatrixFree = !internal::is_ref_compatible<MatrixType>::value>
      |                                                 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:158:7:   required from 'class Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >'
  158 | class BiCGSTAB : public IterativeSolverBase<BiCGSTAB<_MatrixType,_Preconditioner> >
      |       ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:239:23:   required from here
  239 |   typedef EigenSolverT::Scalar                                          Scalar;
      |                       ^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of 'struct Eigen::internal::find_best_packet<double, -1>':
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                         ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, -1, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h:41:43:   required from 'class Eigen::DiagonalPreconditioner<double>'
   41 |     typedef typename Vector::StorageIndex StorageIndex;
      |                                           ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:431:18:   required from 'class Eigen::IterativeSolverBase<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> > >'
  431 |   Preconditioner m_preconditioner;
      |                  ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:158:7:   required from 'class Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >'
  158 | class BiCGSTAB : public IterativeSolverBase<BiCGSTAB<_MatrixType,_Preconditioner> >
      |       ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:239:23:   required from here
  239 |   typedef EigenSolverT::Scalar                                          Scalar;
      |                       ^~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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]
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                                                                        ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1>, 0>':
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7:   required from 'class Eigen::Matrix<double, -1, 1>'
  178 | class Matrix
      |       ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h:41:43:   required from 'class Eigen::DiagonalPreconditioner<double>'
   41 |     typedef typename Vector::StorageIndex StorageIndex;
      |                                           ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h:431:18:   required from 'class Eigen::IterativeSolverBase<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> > >'
  431 |   Preconditioner m_preconditioner;
      |                  ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:158:7:   required from 'class Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >'
  158 | class BiCGSTAB : public IterativeSolverBase<BiCGSTAB<_MatrixType,_Preconditioner> >
      |       ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:239:23:   required from here
  239 |   typedef EigenSolverT::Scalar                                          Scalar;
      |                       ^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:41:7:   required from 'class Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >'
   41 | class SolveWithGuess : public internal::generic_xpr_base<SolveWithGuess<Decomposition,RhsType,GuessType>, MatrixXpr, typename internal::traits<RhsType>::StorageKind>::type
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:38:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h:28,
                 from internal_rtocpp.cpp:22:
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/polygon_soup_io.h: In function 'bool CGAL::IO::read_polygon_soup(const std::string&, PointRange&, PolygonRange&, const CGAL::Named_function_parameters<NP_T, NP_Tag, NP_Base>&)':
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/polygon_soup_io.h:86: note: '-Wmisleading-indentation' is disabled from this point onwards, since column-tracking was disabled due to the size of the code/headers
   86 |     if(verbose)
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/polygon_soup_io.h:86: note: adding '-flarge-source-files' will allow for more column-tracking support, at the expense of compilation time and memory
In file included from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/assert.hpp:35,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:31,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:20:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/int.hpp:20,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda_fwd.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_spec.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/or.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/type_traits.h:16,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Algebraic_structure_traits.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/number_type_basic.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:28:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function 'boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~VertexListGraphConcept()'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro 'BOOST_concept'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from 'struct boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function 'boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~EdgeListGraphConcept()'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro 'BOOST_concept'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function 'boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~IncidenceGraphConcept()'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro 'BOOST_concept'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:960:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::typed_identity_property_map<long long unsigned int>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30:   required from 'Derived& Eigen::DenseBase<Derived>::setConstant(const Scalar&) [with Derived = Eigen::Matrix<double, -1, 1>; Scalar = double]'
  347 |   return derived() = Constant(rows(), cols(), val);
      |                      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:717:21:   required from 'Derived& Eigen::PlainObjectBase<Derived>::setOnes(Eigen::Index) [with Derived = Eigen::Matrix<double, -1, 1>; Eigen::Index = long long int]'
  717 |   return setConstant(Scalar(1));
      |          ~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:276:14:   required from here
  276 |     X.setOnes(B.rows());
      |     ~~~~~~~~~^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from 'struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  182 |     BOOST_CONCEPT_USAGE(VertexListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from 'struct boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:148:7:   required from 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:208:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:148:7:   required from 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::typed_identity_property_map<long long unsigned int>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function 'boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~VertexListGraphConcept()'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro 'BOOST_concept'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from 'struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function 'boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~EdgeListGraphConcept()'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro 'BOOST_concept'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function 'boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~IncidenceGraphConcept()'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro 'BOOST_concept'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, void*>, const boost::detail::edge_desc_impl<boost::directed_tag, void*>&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_reverse_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:960:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, void*>, const boost::detail::edge_desc_impl<boost::directed_tag, void*>&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_reverse_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, boost::vertex_index_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, boost::vertex_index_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:180:7:   required from 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::typed_identity_property_map<long long unsigned int>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<std::_Bit_iterator> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function 'boost::RandomAccessIteratorConcept<std::_Bit_iterator>::~RandomAccessIteratorConcept()'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro 'BOOST_concept'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function 'boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >::~RandomAccessIteratorConcept()'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro 'BOOST_concept'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of 'class Eigen::SparseMatrixBase<Eigen::SparseMatrix<double, 1, int> >':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7:   required from 'class Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 1, int> >'
   36 | class SparseCompressedBase
      |       ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7:   required from 'class Eigen::SparseMatrix<double, 1, int>'
   96 | class SparseMatrix
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1040:66:   required from 'void Eigen::internal::set_from_triplets(const InputIterator&, const InputIterator&, SparseMatrixType&, DupFunctor) [with InputIterator = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; SparseMatrixType = Eigen::SparseMatrix<double, 0, int>; DupFunctor = scalar_sum_op<double, double>]'
 1040 |   SparseMatrix<Scalar,IsRowMajor?ColMajor:RowMajor,StorageIndex> trMat(mat.rows(),mat.cols());
      |                                                                  ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1110:92:   required from 'void Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::setFromTriplets(const InputIterators&, const InputIterators&) [with InputIterators = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1110 |   internal::set_from_triplets<InputIterators, SparseMatrix<Scalar,_Options,_StorageIndex> >(begin, end, *this, internal::scalar_sum_op<Scalar,Scalar>());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:239:29:   required from 'void CGAL::Eigen_sparse_matrix<T>::assemble_matrix() const [with T = double]'
  239 |     m_matrix.setFromTriplets(m_triplets.begin(), m_triplets.end());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:249:7:   required from 'const CGAL::Eigen_sparse_matrix<T>::EigenType& CGAL::Eigen_sparse_matrix<T>::eigen_object() const [with T = double; EigenType = Eigen::SparseMatrix<double, 0, int>]'
  249 |       assemble_matrix();
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:271:42:   required from here
  271 |     m_solver_sptr->compute(A.eigen_object());
      |                            ~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  182 |     BOOST_CONCEPT_USAGE(VertexListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from 'struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Comparable<TT>::~Comparable() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<std::_Bit_iterator>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long int&]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  115 |               make_iterator_property_map(m_time_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::SparseMatrix<double, 1, int>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80:   required from 'struct Eigen::internal::evaluator<Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 1, int> > >'
  336 |   typedef typename DenseCoeffsBase<Derived,ReadOnlyAccessors>::CoeffReturnType CoeffReturnType;
      |                                                                                ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8:   required from 'struct Eigen::internal::evaluator<Eigen::SparseMatrix<double, 1, int> >'
 1505 | struct evaluator<SparseMatrix<_Scalar,_Options,_StorageIndex> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1181:93:   required from 'Eigen::SparseMatrix<_Scalar, _Options, _StorageIndex>& Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::operator=(const Eigen::SparseMatrixBase<OtherDerived>&) [with OtherDerived = Eigen::SparseMatrix<double, 1, int>; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1181 |   const bool needToTranspose = (Flags & RowMajorBit) != (internal::evaluator<OtherDerived>::Flags & RowMajorBit);
      |                                                                                             ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1063:7:   required from 'void Eigen::internal::set_from_triplets(const InputIterator&, const InputIterator&, SparseMatrixType&, DupFunctor) [with InputIterator = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; SparseMatrixType = Eigen::SparseMatrix<double, 0, int>; DupFunctor = scalar_sum_op<double, double>]'
 1063 |   mat = trMat;
      |   ~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1110:92:   required from 'void Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::setFromTriplets(const InputIterators&, const InputIterators&) [with InputIterators = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1110 |   internal::set_from_triplets<InputIterators, SparseMatrix<Scalar,_Options,_StorageIndex> >(begin, end, *this, internal::scalar_sum_op<Scalar,Scalar>());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:239:29:   required from 'void CGAL::Eigen_sparse_matrix<T>::assemble_matrix() const [with T = double]'
  239 |     m_matrix.setFromTriplets(m_triplets.begin(), m_triplets.end());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:249:7:   required from 'const CGAL::Eigen_sparse_matrix<T>::EigenType& CGAL::Eigen_sparse_matrix<T>::eigen_object() const [with T = double; EigenType = Eigen::SparseMatrix<double, 0, int>]'
  249 |       assemble_matrix();
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:271:42:   required from here
  271 |     m_solver_sptr->compute(A.eigen_object());
      |                            ~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:603:11:   required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:603:11:   required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<void*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<void*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<void*>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<void*>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::counting_iterator<long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long long unsigned int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::counting_iterator<long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long long int>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:514:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:109:22: note: in a call to non-static member function 'boost::SignedInteger<long long int>::~SignedInteger()'
  109 |   template <> struct SignedInteger< ::boost::long_long_type> {};
      |                      ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:545:11:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:545:11:   required from 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:573:11:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:573:11:   required from 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<std::_Bit_iterator>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<std::_Bit_iterator> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<std::_Bit_iterator>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<std::_Bit_iterator>'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:603:11:   required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = std::_Bit_iterator]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:597:3:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<std::_Bit_iterator>]'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<void*>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<void*>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<void*>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<void*> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<void*> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = void*]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/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<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_List_iterator<void*> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<std::_List_iterator<void*> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<std::_Bit_iterator> >'
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<std::_Bit_iterator>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = bool; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::_Bit_iterator::reference]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58:   required from 'boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long long unsigned int>; vertex_descriptor = long long unsigned int]'
  108 |         , m_in_active_list_map(make_iterator_property_map(
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  109 |               m_in_active_list_vec.begin(), m_index_map))
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  974 |         algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
      |         ^~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::SparseMatrix<double, 0, int>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80:   required from 'struct Eigen::internal::evaluator<Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 0, int> > >'
  336 |   typedef typename DenseCoeffsBase<Derived,ReadOnlyAccessors>::CoeffReturnType CoeffReturnType;
      |                                                                                ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8:   required from 'struct Eigen::internal::evaluator<Eigen::SparseMatrix<double, 0, int> >'
 1505 | struct evaluator<SparseMatrix<_Scalar,_Options,_StorageIndex> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:79:45:   required from 'void Eigen::internal::assign_sparse_to_sparse(DstXprType&, const SrcXprType&) [with DstXprType = Eigen::SparseMatrix<double, 0, int>; SrcXprType = Eigen::SparseMatrix<double, 1, int>]'
   79 |   const bool transpose = (DstEvaluatorType::Flags & RowMajorBit) != (SrcEvaluatorType::Flags & RowMajorBit);
      |                                             ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:132:28:   required from 'static void Eigen::internal::Assignment<DstXprType, SrcXprType, Functor, Eigen::internal::Sparse2Sparse>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<typename DstXprType::Scalar, typename SrcXprType::Scalar>&) [with DstXprType = Eigen::SparseMatrix<double, 0, int>; SrcXprType = Eigen::SparseMatrix<double, 1, int>; Functor = Eigen::internal::assign_op<double, double>; typename DstXprType::Scalar = double; typename SrcXprType::Scalar = double]'
  132 |     assign_sparse_to_sparse(dst.derived(), src.derived());
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:38:16:   required from 'Derived& Eigen::SparseMatrixBase<Derived>::operator=(const Eigen::SparseMatrixBase<OtherDerived>&) [with OtherDerived = Eigen::SparseMatrix<double, 1, int>; Derived = Eigen::SparseMatrix<double, 0, int>]'
   37 |   internal::Assignment<Derived,OtherDerived,internal::assign_op<Scalar,typename OtherDerived::Scalar> >
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   38 |           ::run(derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |           ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1239:27:   required from 'Eigen::SparseMatrix<_Scalar, _Options, _StorageIndex>& Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::operator=(const Eigen::SparseMatrixBase<OtherDerived>&) [with OtherDerived = Eigen::SparseMatrix<double, 1, int>; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1239 |     return Base::operator=(other.derived());
      |            ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1063:7:   required from 'void Eigen::internal::set_from_triplets(const InputIterator&, const InputIterator&, SparseMatrixType&, DupFunctor) [with InputIterator = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; SparseMatrixType = Eigen::SparseMatrix<double, 0, int>; DupFunctor = scalar_sum_op<double, double>]'
 1063 |   mat = trMat;
      |   ~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1110:92:   required from 'void Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::setFromTriplets(const InputIterators&, const InputIterators&) [with InputIterators = __gnu_cxx::__normal_iterator<Eigen::Triplet<double, int>*, std::vector<Eigen::Triplet<double, int>, std::allocator<Eigen::Triplet<double, int> > > >; _Scalar = double; int _Options = 0; _StorageIndex = int]'
 1110 |   internal::set_from_triplets<InputIterators, SparseMatrix<Scalar,_Options,_StorageIndex> >(begin, end, *this, internal::scalar_sum_op<Scalar,Scalar>());
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:239:29:   required from 'void CGAL::Eigen_sparse_matrix<T>::assemble_matrix() const [with T = double]'
  239 |     m_matrix.setFromTriplets(m_triplets.begin(), m_triplets.end());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_sparse_matrix.h:249:7:   required from 'const CGAL::Eigen_sparse_matrix<T>::EigenType& CGAL::Eigen_sparse_matrix<T>::eigen_object() const [with T = double; EigenType = Eigen::SparseMatrix<double, 0, int>]'
  249 |       assemble_matrix();
      |       ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:271:42:   required from here
  271 |     m_solver_sptr->compute(A.eigen_object());
      |                            ~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0>, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:120:7:   required from 'class Eigen::internal::dense_product_base<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0, 7>'
  120 | class dense_product_base
      |       ^~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:152:7:   required from 'class Eigen::ProductImpl<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0, Eigen::Dense>'
  152 | class ProductImpl<Lhs,Rhs,Option,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Product.h:71:7:   required from 'class Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0>'
   71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
      |       ^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:42:29:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Product<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, 0> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:42:23:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   42 |   VectorType r  = rhs - mat * x;
      |                   ~~~~^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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>':
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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
      |       ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> > >'
   38 |                    >::type Scalar;
      |                            ^~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:27:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
      |                         ~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:23:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
      |                    ~~~^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:18:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
      |             ~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::CwiseBinaryOp<Eigen::internal::scalar_difference_op<double, double>, const Eigen::Matrix<double, -1, 1>, const 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::Matrix<double, -1, 1> > > > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:83:11:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   83 |     p = r + beta * (p - w * v);
      |         ~~^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:86:7:   required from 'class Eigen::SolveImpl<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
   86 | class SolveImpl<Decomposition,RhsType,Dense>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:62:7:   required from 'class Eigen::Solve<Eigen::DiagonalPreconditioner<double>, Eigen::Matrix<double, -1, 1> >'
   62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
      |       ^~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:85:22:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   85 |     y = precond.solve(p);
      |         ~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_sum_op<double, double>, const 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::Matrix<double, -1, 1> >, const 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::Matrix<double, -1, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:100:20:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
  100 |     x += alpha * y + w * z;
      |          ~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/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<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_List_iterator<void*> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_List_iterator<void*> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<std::_List_iterator<void*> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_List_iterator<void*>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long long unsigned int, long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long long unsigned int, long long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7:   required from here
  377 |     return boost::boykov_kolmogorov_max_flow
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  378 |       (graph,
      |       ^~~~~~~
  379 |        boost::get(&EdgeP::edge_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  380 |        boost::get(&EdgeP::edge_residual_capacity, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  381 |        boost::get(&EdgeP::edge_reverse, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  382 |        boost::get(&VertexP::vertex_predecessor, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  383 |        boost::get(&VertexP::vertex_color, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  384 |        boost::get(&VertexP::vertex_distance_t, graph),
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  385 |        boost::get(boost::vertex_index,
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  386 |                   graph), // this is not bundled, get it from graph (CRS provides one)
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  387 |        0, 1);
      |        ~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34:   required from 'class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7:   required from 'class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
   94 | class CwiseUnaryOpImpl
      |       ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7:   required from 'class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >'
   55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:40:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Matrix<double, -1, 1>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:45:40:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = std::_List_iterator<void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<std::_List_iterator<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> > >'
   48 | template<typename Derived> class MatrixBase
      |                                  ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1>, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:44:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Matrix<double, -1, 1>; U = Eigen::Matrix<double, -1, 1>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from 'boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from 'boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5:   required from 'typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long long unsigned int, const long long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38:   required from 'typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1038 |     return boykov_kolmogorov_max_flow(g,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
 1039 |         choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1040 |         choose_pmap(get_param(params, edge_residual_capacity), g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1041 |             edge_residual_capacity),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~  
 1042 |         choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1043 |         choose_pmap(
      |         ~~~~~~~~~~~~                  
 1044 |             get_param(params, vertex_predecessor), g, vertex_predecessor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         choose_pmap(get_param(params, vertex_color), g, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1046 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1047 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1048 |         src, sink);
      |         ~~~~~~~~~~                    
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38:   required from 'typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = void*]'
 1062 |     return boykov_kolmogorov_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45:   required from here
  248 |     return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
  249 |                                                       cluster_sink);
      |                                                       ~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<double>, const Eigen::Matrix<double, -1, 1> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_abs2_op<double>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:98:46:   required from 'typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::squaredNorm() const [with Derived = Eigen::Matrix<double, -1, 1>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]'
   98 |   return numext::real((*this).cwiseAbs2().sum());
      |                       ~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:45:40:   required from 'bool Eigen::internal::bicgstab(const MatrixType&, const Rhs&, Dest&, const Preconditioner&, Eigen::Index&, typename Dest::RealScalar&) [with MatrixType = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; Preconditioner = Eigen::DiagonalPreconditioner<double>; Eigen::Index = long long int; typename Dest::RealScalar = double]'
   45 |   RealScalar r0_sqnorm = r0.squaredNorm();
      |                          ~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:199:34:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; Eigen::Index = long long int]':
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> > >; Scalar = double]'
  243 |     const Index alignedStart = internal::first_default_aligned(xpr);
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  418 |   return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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_conj_product_op<double, double>, const Eigen::Matrix<double, -1, 1>, const Eigen::Matrix<double, -1, 1> >; typename Eigen::internal::traits<T>::Scalar = double]'
  463 |   return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:37:51:   required from 'static Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::ResScalar Eigen::internal::dot_nocheck<T, U, NeedToTranspose>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Matrix<double, -1, 1>; U = Eigen::Matrix<double, -1, 1>; bool NeedToTranspose = false; ResScalar = double]'
   37 |     return a.template binaryExpr<conj_prod>(b).sum();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Dot.h:84:58:   required from 'typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType Eigen::MatrixBase<Derived>::dot(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Matrix<double, -1, 1>; Derived = Eigen::Matrix<double, -1, 1>; typename Eigen::ScalarBinaryOpTraits<typename Eigen::internal::traits<T>::Scalar, typename Eigen::internal::traits<OtherDerived>::Scalar>::ReturnType = double; typename Eigen::internal::traits<T>::Scalar = double; typename Eigen::internal::traits<OtherDerived>::Scalar = double]'
   84 |   return internal::dot_nocheck<Derived,OtherDerived>::run(*this, other);
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h:71:17:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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);
      |                                                                          ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80:   required from 'struct Eigen::internal::evaluator<Eigen::SparseCompressedBase<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > > >'
  336 |   typedef typename DenseCoeffsBase<Derived,ReadOnlyAccessors>::CoeffReturnType CoeffReturnType;
      |                                                                                ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:364:8:   required from 'struct Eigen::internal::evaluator<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> > >'
  364 | struct evaluator<Ref<const SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType> >
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseUtil.h:121:8:   required from 'struct Eigen::internal::plain_object_eval<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Sparse>'
  121 | struct plain_object_eval<T,Sparse>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/SparseCore/SparseDenseProduct.h:187:104:   required from 'static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::SparseShape, Eigen::DenseShape, ProductType>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix<double, -1, 1>; Lhs = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; int ProductType = 7; Scalar = double]'
  187 |     typedef typename nested_eval<Lhs,((Rhs::Flags&RowMajorBit)==0) ? 1 : Rhs::ColsAtCompileTime>::type LhsNested;
      |                                                                                                        ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:361:27:   required from 'static void Eigen::internal::generic_product_impl_base<Lhs, Rhs, Derived>::scaleAndAddTo(Dst&, const Lhs&, const Rhs&, const Scalar&) [with Dst = Eigen::Matrix<double, -1, 1>; Lhs = Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Matrix<double, -1, 1>; Derived = Eigen::internal::generic_product_impl<Eigen::Ref<const Eigen::SparseMatrix<double, 0, int>, 0, Eigen::OuterStride<> >, Eigen::Matrix<double, -1, 1>, Eigen::SparseShape, Eigen::DenseShape, 7>; Scalar = double]'
  361 |   { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); }
      |     ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:349:33:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, 0>':
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7:   required from 'class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, 2>'
  481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34:   required from 'class Eigen::DenseBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7:   required from 'class Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >'
   42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
      |       ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h:91:26:   required from 'void Eigen::DiagonalPreconditioner<_Scalar>::_solve_impl(const Rhs&, Dest&) const [with Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; _Scalar = double]'
   91 |       x = m_invdiag.array() * b.array() ;
      |           ~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:147:26:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of 'class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >, 0>':
D:/RCompile/CRANpkg/lib/4.7/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::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > > >'
   41 | template<typename Derived> class DenseBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34:   required from 'class Eigen::ArrayBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > > >'
   39 | template<typename Derived> class ArrayBase
      |                                  ^~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7:   required from 'class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, Eigen::Dense>'
  148 | class CwiseBinaryOpImpl
      |       ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7:   required from 'class Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> >, const Eigen::ArrayWrapper<const Eigen::Matrix<double, -1, 1> > >'
   77 | class CwiseBinaryOp :
      |       ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h:91:29:   required from 'void Eigen::DiagonalPreconditioner<_Scalar>::_solve_impl(const Rhs&, Dest&) const [with Rhs = Eigen::Matrix<double, -1, 1>; Dest = Eigen::Matrix<double, -1, 1>; _Scalar = double]'
   91 |       x = m_invdiag.array() * b.array() ;
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Solve.h:147:26:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h:109:37:   required from 'static void Eigen::internal::Assignment<DstXprType, Eigen::SolveWithGuess<DecType, RhsType, GuessType>, Eigen::internal::assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense>::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Matrix<double, -1, 1>; DecType = Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >; RhsType = Eigen::Matrix<double, -1, 1>; GuessType = CGAL::Eigen_vector<double>; Scalar = double; SrcXprType = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >]'
  109 |     src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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::Matrix<double, -1, 1>; Src = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Func = assign_op<double, double>]'
  890 |   Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41:   required from 'Derived& Eigen::PlainObjectBase<Derived>::_set_noalias(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  797 |       internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>());
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19:   required from 'Eigen::PlainObjectBase<Derived>::PlainObjectBase(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; Derived = Eigen::Matrix<double, -1, 1>]'
  594 |       _set_noalias(other);
      |       ~~~~~~~~~~~~^~~~~~~
D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29:   required from 'Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase<OtherDerived>&) [with OtherDerived = Eigen::SolveWithGuess<Eigen::BiCGSTAB<Eigen::SparseMatrix<double, 0, int> >, Eigen::Matrix<double, -1, 1>, CGAL::Eigen_vector<double> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]'
  423 |       : Base(other.derived())
      |                             ^
D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Eigen_solver_traits.h:277:42:   required from here
  277 |     X = m_solver_sptr->solveWithGuess(B,X);
      |                                          ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                              ^~~~~~~~~~~~~~~~
g++  -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.7/BH/include' -I'D:/RCompile/CRANpkg/lib/4.7/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include' -I'D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"   -DCGAL_HEADER_ONLY=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c internal_utils.cpp -o internal_utils.o
In file included from D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:205,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Dimension.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Bbox_2.h:22,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic_classes.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
                 from SurfaceMesh.h:17,
                 from internal_utils.cpp:14:
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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;
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                       ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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 }; };
      |                                        ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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> {
      |                                           ^
D:/RCompile/CRANpkg/lib/4.7/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) {
      |                                  ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/RcppEigen/include/Eigen/Core:174:
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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)
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/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> {          \
      |                                                            ^
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/bind.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/mpl/lambda.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian_converter.h:36,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Filtered_kernel.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:21:
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.7/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 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.7/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 D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/property_map.h:18,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
                 from SurfaceMesh.h:19:
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/std_thread.h:43,
                 from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/thread:45,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/config.h:428,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/basic.h:21,
                 from D:/RCompile/CRANpkg/lib/4.7/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20:
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.7/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.3.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
g++ -shared -s -static-libgcc -o SurfaceMesh.dll tmp.def RcppExports.o export_alpha_wrap.o export_boolean.o export_bounding.o export_hausdorff.o export_mesh.o export_normals.o export_read_write.o export_reconstruct.o export_remesh_acvd.o export_remesh_delaunay.o export_remesh_isotropic.o export_remesh_simplify.o export_remesh_smooth.o export_repair.o export_subdivide.o internal_cpptor.o internal_rtocpp.o internal_utils.o -lmpfr -lgmp -Ld:/rtools45/x86_64-w64-mingw32.static.posix/lib/x64 -Ld:/rtools45/x86_64-w64-mingw32.static.posix/lib -LD:/RCompile/recent/R/bin/x64 -lR
make[1]: Leaving directory '/d/temp/2026_11_18_19_01_12_26750/RtmpEh6Oah/R.INSTALL18581824e07561/SurfaceMesh/src'
make[1]: Entering directory '/d/temp/2026_11_18_19_01_12_26750/RtmpEh6Oah/R.INSTALL18581824e07561/SurfaceMesh/src'
make[1]: Leaving directory '/d/temp/2026_11_18_19_01_12_26750/RtmpEh6Oah/R.INSTALL18581824e07561/SurfaceMesh/src'
installing to d:/Rcompile/CRANpkg/lib/4.7/00LOCK-SurfaceMesh/00new/SurfaceMesh/libs/x64
** R
** data
*** moving datasets to lazyload DB
** 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
** testing if installed package can be loaded from final location
** testing if installed package keeps a record of temporary installation path
* MD5 sums
packaged installation of 'SurfaceMesh' as SurfaceMesh_0.1.2.zip
* DONE (SurfaceMesh)